Mathias Hall-Andersen (@rotn256) header
Mathias Hall-Andersen (@rotn256) profile picture

Cryptographer, machine whisperer, cofounder at @zksecurityXYZ.

Joined July 2026
Photo by Mathias Hall-Andersen (@rotn256)Photo by Mathias Hall-Andersen (@rotn256)Photo by Mathias Hall-Andersen (@rotn256)Photo by Mathias Hall-Andersen (@rotn256)
With Riemann seemingly solved, I challenge our machine gods to find out if this silly little function: f :: Int -> Int f 1 = 0 f n | even n = 1 + f (n `div` 2) | otherwise = 1 + f (3 * n + 1) Always terminates.
14
11
4
344
19,785
Mathias Hall-Andersen retweeted
Yesterday we announced that we asked President @vonderleyen to withdraw the @euinc_petition proposal. Here is me visiting her to discuss this a few weeks ago. For the record: we are not against against the EU Inc proposal. It's the opposite. We are its biggest supporters. But "business as usual" in Brussel broke several fundamentals. And the commission should get everyone back on the table. Europe doesn't have time for Business as usual anymore. If it would now go into the final step, we end up with a massive PR fiasco. Appreciate your reshares - here is the youtube video as well: youtube.com/watch?v=x1_4b_YK…
70
209
36
1,028
63,618
Mathias Hall-Andersen retweeted
Well, looks like @__alpoge__ & @claudeai are claiming a proof of the Riemann Hypothesis alpo.ge/remark.pdf
172
780
592
6,529
1,245,929
Mathias Hall-Andersen retweeted
Late to our own "take one step back to take two steps forward" party on X, but we are officially now asking the European Commission and President Ursula von der Leyen to 𝘄𝗶𝘁𝗵𝗱𝗿𝗮𝘄 𝗮𝗻𝗱 𝗿𝗲-𝘁𝗮𝗯𝗹𝗲 𝘁𝗵𝗲 𝗘𝗨 𝗜𝗻𝗰 𝗽𝗿𝗼𝗽𝗼𝘀𝗮𝗹. linkedin.com/feed/update/urn…
16
88
44
530
59,211
Don't get the controversy, Astra 6.2 is a perfectly cromulent model. Its zk.golf improvements last 24 hours:
4
1
16
1,826
Turns out humans are kind of terrible at writing software. Maybe the true slop was the code we wrote along the way?
1
10
503
Expectation: sophisticated AI-powered cyber weapons of doom and destruction. Reality: feeding AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA= to your Base64 decoder. calif.io/java4shell
1
4
286
Mathias Hall-Andersen retweeted
Attackers don't wait for your next audit anymore. AI bug hunters can read your code every day of the year. Most teams get a security review once or twice a year. That gap is the problem. 🧵
2
4
5
463
Mathias Hall-Andersen retweeted
Keep up with cryptography, formal verification and bug hunting. zkSecurity has a newsletter now! zksecurity.xyz/newsletter/
3
9
53
2,333
Mathias Hall-Andersen retweeted
Check out our formal verification work with Monero!
zkSecurity Reviews Generalized Bulletproofs and Publishes a Lean Proof of Its Security (@zksecurityXYZ) magicgrants.org/2026/11/12/G…
1
3
16
898
Mathias Hall-Andersen retweeted
We’re blazing a trail in formal verification and auditing for complex cryptography, so we can ship Tachyon safely. The assistance of @zksecurityXYZ has been crucial for our team.
18
68
3,512
Mathias Hall-Andersen retweeted
wonderful collaborating with @AndrijaNovakov6 and @ronrothblum! to highlight a bit: the cool thing about this work is how smoothness allows you to achieve a joint agreement set smoothness allows you to obtain a punctured code (looking at a smaller set of coordinates), where *every* remaining parity check is now satisfied - after removing the few checks violated by either u or v therefore a fold of the form u + r*v must be far (w.h.p) from a codeword if u and v were jointly far from a codeword the quality of how far depends on the smoothness, which the main lemma shows is half the expansion-based distance of the original code if there are too many violated parity checks - then you can directly see the fold will be far from the code (w.h.p) see how AI imagines it
Happy to announce new work with @kobigurk and @ronrothblum . We prove unique decoding radius proximity gaps for expander codes with sufficient expansion. Expanders codes are used in prover efficient SNARKs like Brakedown and Bolt.
2
23
1,164
Mathias Hall-Andersen retweeted
Excellent In many hash based snarks you need to do many openings, and this allows you to batch them really efficiently, and even sometimes batch a part of the opening protocol with the proof system itself Reduces bolt-max proof size by half with some prover overhead! H/t @AndrijaNovakov6
Hash-based vector commitments are a key primitive, but we only really have one construction: Merkle trees. MTs are great, but have a key issue: opening proofs need logN hashes. This adds up when we open many points (eg hash-based pfs) In a recent paper, we ask: can we do better?
3
5
1
59
2,365
Mathias Hall-Andersen retweeted
Repeat after me. Docker is not a security boundary. Once again, with feeling.. DOCKER IS NOT A SECURITY BOUNDARY!
Docker sandboxes is probably the single most important tool you can learn in the AI age.
67
85
14
1,571
105,304
Mathias Hall-Andersen retweeted
*sshole is out if you run sshd on alpine, openwrt or any musl box with password auth on: update now official writeup: sshhole.com
86552c7e1e5d46882844cffabb44d454129ff22927f13797b151c9db4519d47d
187
890
446
5,451
1,576,416
Mathias Hall-Andersen retweeted
Replying to @sampullara
The current moment actually reminds me of 1998. You'd just grep -rnE 'memcpy|strcpy' in something +s, and there would be 948 results!
1
41
1,702
Mathias Hall-Andersen retweeted
Anthropic is releasing an open source library, FlashProve, for provable inference. It was measured on Llama 4 Maverick, a 400B-parameter mixture of experts model. Code: github.com/anthropics/FlashP… Blog post: anthropic.com/research/prova…
50
90
43
745
109,654