Neiman (@neiman30) header
Neiman (@neiman30) profile picture

Math | Crypto | sff | Hackerspaces | Internet States | DAOs | dWeb | Light-Cryptoanarchism -- founder @e_steroids and @GoAlmonit (discontinued)

Joined March 2016
Photo by Neiman (@neiman30)Photo by Neiman (@neiman30)Photo by Neiman (@neiman30)Photo by Neiman (@neiman30)Photo by Neiman (@neiman30)Photo by Neiman (@neiman30)Photo by Neiman (@neiman30)Photo by Neiman (@neiman30)Photo by Neiman (@neiman30)Photo by Neiman (@neiman30)
הייתי בת היום שנים כשהבנתי למה קוראים לאגם בשיר ״תנין״ של ערוץ הכיבוד ״אגם התברוטוס״
1
4
109
טוב, הדמוקרטים ניצחו בתחרות הסרטון הכי מצחיק 🤣🤣🤣
49
211
21
3,166
114,808
I've been really nerding about about RS codes and the ethereum Proximity Prize problems. I decided to write 2 articles: "Reed Solomon Codes For Dummies" and "Mutual Correlated Agreement For Dummies". These two articles explain the Proximity Prize problem as simply as possible and assume zero math background. By the end of the 2nd article, you will be able to explain MCA to a 5th grader. They are titled "For Dummies" because I used to be a dummy on this topic, and now I am less of one on the topic 😅️️️️️️ This is also related to the topic I will be giving a workshop on in Mumbai at @EFDevcon ! Article 1: hackmd.io/@-urCr-W9R8mS-UktG… Article 2: hackmd.io/@-urCr-W9R8mS-UktG…
6
6
65
2,308
Good morning everyone, release time 🔥 The Ark Emulator is effective immediately available for anyone to download & run: - Pair it with the Ark Companion mobile app - Manage data and run apps through the Ark Hub - Build new apps against your own genome blog.dark.bio/2026/10/12/dar…
4
14
5
79
15,792
Denmark’s stolen gov database was accessed by attackers using the exact same combination as my luggage!
1
2
12
569
UPDATE: I can confirm that the Ledger supply chain is compromised in Europe as well. @Ledger should initiate an immediate product recall to protect users. I just purchased a second device from a different Mediamarkt location today, recorded the unboxing process, and discovered spyware once again (video linked in the second tweet). The device was compromised in the exact same manner, featuring identical modifications (such as additional cables and an LTE module). This indicates its a widespread issue rather than an isolated incident, potentially affecting Ledger inventory across MediaMarkt and Saturn stores throughout Europe (comprising over 1,000 stores across 11 countries). My initial hypothesis was that these devices were returns that looked unopened to the employees and were just sold again as new however, a MediaMarkt employee confirmed that the device I purchased was not a return, and that returned Ledgers are sent directly back to the manufacturer rather than resold. Store records show the inventory originated from Aqipa GmbH. While Ledger's CTO was unsure if Aqipa serves as the direct distributor between Ledger and MediaMarkt, it appears to be the case. Given that Aqipa distributes across Europe, any physical retail store receiving stock through them may be at risk. I sent the first ledger to mark and the second one is going to ledger now, so that they can analyse it. If you purchased a ledger from anyone other than the official ledger store, make sure to check your device!!
700
1,981
671
11,450
2,098,811
“I ran <best internal model> for N trillion tokens at <frontier lab> and it couldn’t even dent <fundamental assumption>” should automatically get Best Paper at CRYPTO/Eurocrypt.
9
18
3
179
7,010
Neiman retweeted
a friend of my cat has a neighbor who heard a rumor that OpenAI broke hybrid ML-KEM+ECC which would explain why CNSA went for non-hybrid and I dont wanna speculate but AES is probably at risk too
23
34
10
311
51,750
Is public key encryption broken? My thoughts as someone working in the field but with no concrete information from any AI lab. THE MYSTERY: The latest batch of math results by OpenAI includes earth-shatterring improvements on things like integer multiplication, and matrix multiplication. Mysteriously, no reported improvements on any problem related to cryptography, like factoring or lattice problems. WHY? Two possible explanations and one non-explanation. Non-explanation: No such improvement was found. I find that unlikely. Explanation 1: Some cryptography is now utterly broken, and the AI labs are working with national security agencies and industry to prepare fixes (in the mean time breaking adversaries' crypto). Explanation 2: No cryptography is broken but there are results that may lead to that. These results haven't been released because AI companies and Government are worried that others (China?) may use that to rush and break cryptography. What's your take?
62
42
12
425
100,028
Replying to @VitalikButerin
Current hashes have *some* structure - many rounds of same op for one thing. It's total speculation to say AI will break elliptic curve discrete log before it breaks a specific hash like sha2 And it's also total speculation to say it'll break either of them So far afaik it's given us small asymptotic improvements that are not practical in algorithms like integer mult.
2
7
43
22,768
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…
1,247
1,916
895
11,169
3,950,143
I wasn’t going to comment since this is a really bad take IMO, but since it’s taken off I feel the need to. To my understanding, there is no evidence whatsoever pointing to a break of decades old hardness assumptions like elliptic curve cryptography. 1/n
Today I call upon the blockchain industry to calmly begin planning for "bunker mode". My personal recommendation is to set in motion a controlled mass migration of assets to fresh addresses, i.e. addresses whose pubkeys remain hidden behind a hash. Holders, starting with large and sophisticated ones, should consider moving the bulk of their funds to addresses that have never signed a transaction. And when they do sign one, they should also move remaining funds to a new address (possibly generated from the same seed phrase). Don't rush. While I believe there is cause for action a rushed migration would do more harm than good. Don't panic either. Moving assets to protected addresses is a simple, preventative step which does not require new cryptography or new wallets. IMO it is now reasonable to brace for the possibility that ECDSA breaks before qday, in the worst case in months not years. By "break" I mean fast private key recovery (e.g. in one week) on available hardware (e.g. a large GPU cluster). Recent days have been humbling for human mathematical intuition. Long-held, unquestioned hypotheses have fallen. This includes the n log(n) bound for integer multiplication and the 3SUM conjecture. In hindsight, May's unexpected disproof of the Erdős unit distance conjecture was our warning shot. Yesterday's OpenAI drop made it clear that mathematical superintelligence is upon us. They say there are weeks where decades happen. We are about to live through weeks where centuries of mathematical progress happen. Could our magic 64-byte ECDSA signatures be too good to be true? Was it just security through obscurity all this time? Elliptic curves feel especially vulnerable to superintelligence. Curves carry rich structure, with room for fancy tricks like Schoof, Frobenius, pairings. (By contrast, hashes are designed to minimise algebraic structure.) Separately, as Ewin Tang can attest, an efficient quantum algorithm sometimes foreshadows an efficient classical one. We should be open to the possibility of a classical counterpart to Shor that breaks elliptic curves and RSA at once. Also noteworthy is the striking under-representation of cryptographic breakthroughs among the 722 mathematical results OpenAI published. I've witnessed first-hand the US government censoring academic quantum cryptanalysis results. Backroom interventionism is my base case. I urge large, sophisticated actors to lead by example. Project11's "risq list" (bitcoin-risq-list.projecteleven[.]com) is a great tracker of exposed BTC pubkeys. Binance, Bitbank, Robinhood, Bitfinex, and Tether have an opportunity to harden their cold storage. Next month I'll address institutions in London in a live Q&A (forum.ethereuminstitutional[.]org/london-2026). Again, please do not rush. Wallets holding under 50 BTC enjoy partial cover from "Satoshi's shield", i.e. his 20K exposed addresses that hold 50 BTC each. Load-bearing signers like oracles and L2 security councils should consider rotating ECDSA pubkeys with every signed message and/or multi-signing with a hash-based schemes like SPHINCS. Exiting bunker mode safely will require post-AI cryptography. My inclination is to go all-in on hash-based cryptography and avoid structured mathematical assumptions entirely, whether from curves, lattices, or isogenies. A single battle-tested hash (e.g. from the SHA or BLAKE families) yields plausible post-AI security. The Ethereum roadmap on strawmap[.]org fully embraces hash-based cryptography with end-to-end formal verification as a response to the quantum threat. Those timelines must now be revisited and accelerated in light of mathematical superintelligence. I'll be pushing for maximum defensive acceleration.
85
394
99
2,258
359,882
A very clear and concise description of the current status of the Classic McEliece encryption scheme bsi.bund.de/SharedDocs/Downl…
10
2
34
5,287
Announcing hashsma.sh! 𝟘 𝟙 ❒ 🔨 Strengthen cryptography with AI. Cryptography—both current and post-quantum cryptography—depends on hashes. SHA-256? SHA-3? BLAKE3? Nobody knows if they are secure. We're going to find out! Come help accelerate scientific research! HashSmash is an open science-acceleration project in collaboration with @yukonresearch, @eigenlabs, @projecteleven, and @ShieldedLabs.
63
166
74
830
237,052
This guy re-created all the adobe apps with opus-5.5, ported them to rust, and opensourced them something really cool is happening
Readers added context they thought people might want to know
These projects are partial open-source Rust reimplementations of Adobe apps (built rapidly with AI agents), not complete recreations; their READMEs and roadmaps document many missing features and features still in development. github.com/storytold/phot… github.com/storytold/vect… github.com/storytold/vect… github.com/storytold/film… github.com/storytold/film… github.com/storytold/ligh… getartcraft.com
589
2,646
511
50,994
1,958,931
Wow!!! Real RSA-1024 signature forgery. Interestingly, it doesn’t break the key but uses a different approach by Joux et al. that was known but pretty much ignored. eprint.iacr.org/2026/2131.pd…
4
24
118
13,521
While studying PLONK, I came across several resources, and I would recommend two of them in particular: the LambdaClass article and a lecture by Dan Boneh for a 2023 MOOC. David Wong also has a series of short videos that are well worth watching. The LambdaClass article is the best one, in my opinion, because it lays out all the calculations in detail. It doesn't present a simplified version or try to explain things through heuristics. However, it can be a difficult read, and some steps lack motivation. I wasn't particularly fond of some other articles and series on PLONK. They try to make things easier by explaining highly simplified versions that have little connection to actual practice, or they simply provide a set of recipes to follow. PLONK is not easy, especially its copy constraints. The problem isn't the general idea, but the details. Why cosets? Why are the permutation functions defined this way? Why do we need the accumulator? One problem with many mathematical articles is that their answer often boils down to: "Trust me, bro, this works."
4
35
1,179
📸🐒 הוכרזו הפיניאליסטים ל 2026 בתחרות הצילום החמודה מכולן (צילומי טבע קומיים של ניקון). הזוכים בדצמבר, ובינתיים תהנו: dpreview.com/photography/wil…
5
19
369
10,995
איזו פרסומת גרועה זו ללוטו עם מלמיליאן וחנן אזולאי. נהדר. יש מצב שזה מתקרב ל-@tiktokperiferia
12
2
3
92
13,286