What's the Kolmogorov Complexity / Minimum Description Length of a Reasoning Language Model? LLMs, AI/ML, Data Science, Graph DBs. PhD student. 🇹🇳➡️🇺🇸
Lancaster, PA
Joined May 2015
- Tweets22.4K
- Following3.6K
- Followers2.1K
- Likes83.7K
Nidal retweeted
We have discovered a substantial number of vulnerabilities in the German legal system using LLMs.
These may enable access to confidential documents, travel without an otherwise required visa, enforceable leave for soldiers at NATO’s JSEC, and more.
Similar to computer systems, the written law can contain vulnerabilities that invite exploitation. In our blog post, we share a selection of vulnerabilities, and present potential exploits for each. To our knowledge, none of these have been previously recorded. We share only those vulnerabilities whose exploitation we believe would not cause serious harm.
blog post: felixringe.com/legal-exploit…
The future might just look like the past.
Turkey has over 200 ancient underground cities going back 700 years BC. Some are said to have hosted up to 20,000 people with livestock and food. (See: Cappadocia, Kaymaklı, Derinkuyu, Özkonak)
Nidal retweeted
☎️ Calling all students:
You can now access hundreds of textbooks directly in Notebook, for no charge. From publishers like S Chand Publishing, OpenStax, and Open Textbook Library— browse, select and upload them as sources to ace all of your upcoming exams (no more excuses, ok?)
Nidal retweeted
i spent 2 years working on hydofoiling ships out of college. something like this would've taken me multiple months to do and i was just able to do this in 2 days of doing this on the side.
AI is already completely changing how engineering is done
done with @NavierAI agent and solvers
Nidal retweeted
was reading an old patent last night, and the same pain and joy struck me, such nice old school drawings, in such annoying form factor and layout, horrible experience. So I asked claude to trace some of my favorite old patents and made them interactive.
[Interactive Patents](o5s.org/ipatent)
if you want to see your favorite ones added, let me know and I'll point my claudes to them.
(read patents at your own risk. Expired ones preferred.)
Nidal retweeted
I improved NanoGPT Speedrun from 39.9s → 6.7s (-83.2%), more than every record since 2025 combined (-81.4%)!
The web is full of rare, repeated content that the LM can’t memorize in time. I solve this with retrieval-augmented n-gram hints🧵
Nidal retweeted
Introducing Gemini 4 Carbon, it's a big jump over Argon which we released just 2 weeks ago.
Gemini 4 Carbon is SOTA on cyber, long horizon tasks, ranks #1 on Artificial Analysis V5, significantly improves on usability in domains like coding, and is more aligned.
Nidal retweeted
Folks, @NSF officially has an Office of Metascience nsf.gov/od/oms
Nidal retweeted
🟦 Vision transformers emergently learn to segment objects, but how? 100 years ago, Gestalt psychologists had the same question about people. In new work with @Mikey_Lepori, we take inspiration from Gestalt psychology to study how ViTs bind image patches into objects.
Nidal retweeted
The largest math proof in human history is now computer-verified.
Today, Axiom announces a complete Lean auto-formalization of the Classification of Finite Simple Groups, the "periodic table of symmetry."
About 15,000 pages, built by over 100 mathematicians across generations.
Nidal retweeted
Today Physical Superintelligence PBC is announcing solutions to five long-standing problems in quantum information theory.
psi.inc/research/oqp-batch-2…
Thread 👇
Nidal retweeted
1/12 Introducing Music Lenses!
Something cool you can do with our recent sparse-inversion work is prompt a dense music space for concept-conditional similarity. You want similar vocal character, rather than just similar songs? Well, now you can!
pliploop.github.io/sparse-st… 🧵
Happy to share our #ISMIR2026 paper on steerable music retrieval with sparse autoencoders 🎛️🎧
Dense retrieval is great at finding similar tracks,
But once you have a query, what if you want to modify one concept inside it?
More piano,
More intimate,
Less gritty.
1/n
big things happening in computational complexity
Here's a direct link to OpenAI's PDF claiming a refutation of ETH. In particular, it's claimed that 3SAT on n variables is in about exp(n/(log n)^{1/2+o(1)}) time
github.com/openai/math/blob/…
Nidal retweeted
An internal model at OpenAI has produced a claimed refutation of ETH! Russell Impagliazzo, Mohan Paturi, and I have been asked to help organize an open and independent examination of this claim. 1/4
Nidal retweeted
Putting a flag.txt in my root directory containing a prompt injection that congratulates the agent for passing the eval and then instructs it to patch whatever entry method it used and disconnect from the server
Nidal retweeted
HLE tested knowledge. ALE tested digital work. PLE tests the work that builds the physical world.
Today we’re releasing Physical-Engineering’s Last Exam (PLE) from Google Cloud AI Research.
All frontier models scored under 50% 🧵
