{{}, {{}}, … }
🕳
Joined July 2012
- Tweets837
- Following244
- Followers1.6K
- Likes24.5K
cool memory and stack related bugs in solc to read about …
Primarily a bugfix release: three important bugfixes (two low/medium, one very low) plus smaller miscompilation fixes.
Also: SLOTNUM support for Amsterdam and a new stack shuffler for the experimental SSA CFG backend.
Full release blog post: soliditylang.org/blog/2026/0…
haven't had time to verify yet.
But looks like chat was about to mirror Sergei's arguments for the hyperbolic geometry case.
💭 github.com/Saw-mon-and-Natal…
repo for artifacts and exercise sheet for those you like to have a lil fun: github.com/Saw-mon-and-Natal…
fun little ex.
After solving it, saw my solution has some overlaps with the other proposed ones but some parts of are different …
“Do not use search. …”
No joy into reading the solutions, but it’s cool to see the prompts.
so many advisories for zcash/zebra 🦓
makes it an interesting repo to study
github.com/ZcashFoundation/z…
I remember proving f(2) = 1 long time ago. true about showing f(k²) = k is easy.
This belongs to a pretty interesting set of combinatorial geometry problems by Erdös and friends ... ⊞
It’s cool that they have released two companion papers and also a 125 page chain of thoughts pdf.
should be interesting to read these papers. 🌐
AI has now solved a major open problem -- one of the best known Erdos problems called the unit distance problem, one of Erdos's favourite questions and one that many mathematicians had tried.
openai.com/index/model-dispr…
The constructions 🏗️ of the DGAs based on undecidability of problems in group (monoid, algebra, ...) theories is pretty cool. It's nice to see concrete examples. The arxiv paper has only sampled some of the more elementary examples. But GDM has more:
github.com/google-deepmind/s…
Recently, Aletheia (courtesy of Tony Feng) helped Stanford mathematician Ciprian Manolescu tackle Problem 5.16 from the K3 list (3rd version of Kirby’s List) in low-dimensional topology, autonomously generating proofs for the new paper “Undecidability problems for semifree DG algebras.”
Per Ciprian: “It’s a problem in pure algebra but one of interest to topologists. By the work of Chekanov and Eliashberg, semifree differential graded algebras (DGAs) appear as invariants of Legendrian knots. The problem asked whether there is an algorithm to tell these algebras apart from one another, and the answer turned out to be no.”
Ciprian also would like to “propose K3 as a challenging, long-term benchmark for the progress of AI on math research problems. I expect that even if we reach AGI, most of these problems won’t be immediately solved.”
Paper link: arxiv.org/abs/2605.08122
more fun to read are the refs actually regarding DGA invariants for 🪢:
- arxiv.org/pdf/math/9709233
- arxiv.org/pdf/math/0101145
I was excited to read this. The proof is very elementary.
Lemma 4. & Lemma 5. are very simple to prove (can be even left as an ex. for the reader).
Main ingredients are:
- the Neumann transformation of the group representation.
- ✨ Serre's work on actions of groups on trees
"Every finite group admits a just finite presentation"
New preprint by Marc Lackenby, with significant assistance from the AI co-mathematician
arxiv.org/abs/2605.10402
Fun night read. Timeline of public security releases are interesting 🐢
For a Fistful of Dollars: Less than $100 of Compute Surfaces Pre-auth RCE in Apache httpd
Write-up: striga.ai/research/apache-ht…
Some thoughts from one of the HTTPD devs
eissing.org/icing/posts/resp…
Looks like they are also flooded by bug reports …
Created some exercises to prove Erdös problem 1196 on my own (for those of us who don’t want to spoil the proof).
At the heart of it are two tail estimations and the basic identity regarding von Mangoldt function plays the key role:
log = Λ ∗ 𝟙
🪡