Shreyas Srinivas

Gentle timely reminder since the STOC deadline is coming up

I think Tom Hales's guest post on "What's new" might have overstated the issue with lean kernel bugs: You are orders of magnitude more likely to have a bug in your informal proof or lean statements than end up exploiting a kernel bug in lean (+ other ITPs). #Mathsky #AlgorithmsTheory #CSTheory

“The companies developing these sociotechnical systems aim to establish a private monopoly over cognition and knowledge, built on the plunder of the entirety of humanity’s cultural, textual, and visual output.”

A bound smashing olympics leaderboard bigospeedrun.com

OpenAI’s faster Fourier transform is less a mathematical breakthrough and more a malicious exploit of mathematical traditions.

In the end I didn't get to solve the problem, but at least I formalized a full solution by combining all the ingredients (including an idelic construction of narrow ray class fields for real quadratic fields... 😎). Have a look at my repo if you find this stuff interesting! github.com/marozols/SIC...

New fraud dropped: arxiv.org/abs/2610.10072 > The result is also contained in a paper released by OpenAI on October 6, 2026, in which the proof strategy and specific choices of notation are identical to a preliminary version of the present paper that was uploaded to ChatGPT on September 8, 2026.

Me: Ahh! new “almost-linear time matching algorithm” … can we implement it? Codex: No. It just uses a normal algorithm for anything with less than ~10^(30000000000000000000000) vertices. Me: Oh, my graphs aren’t that big.

TCS in a nutshell? 🙊

well, I just used OpenRouter to send 20 12x12 addition questions to GLM-4.7, an open source Chinese model, and it returned correct sums in every case.

I am sort of constantly baffled by critics (which I am, more than not!) who don't feel like they have to stay apprised of what these things can actually do. not least you're going to come off like a fool, but also it's not at all like knowing what they can do obviates the criticisms of them?

I am not sure how to feel about this. One the one hand, if Anthropic is asking researchers to look at their pdfs then yeah compensation seems justified

If you are formalizing anything in lean and you are not a foundations expert, please avoid using axioms at all costs. A formalization with axioms is almost always fatally flawed. At that point it is a net negative for the community. #Algorithms #AlgorithmsTheory #Lean4

I deleted my previous post on the second law of thermodynamics, thereby showing posting about entropy is a reversible process.

A group of 25 Fields Medalists, including myself, have made a joint declaration on Math and AI: mathandai.org . We welcome additional signatories. See also this article in the Economist announcing the declaration: www.economist.com/science-and-...

As the possibly apocryphal quote from pioneering computer scientist Edsger Dijkstra goes: Computer science is no more about computers than astronomy is about telescopes. In this week’s Qualia column, writer Ben Brubaker goes deep on whether it’s fair. www.quantamagazine.org/does-compute...

"We're all worried," as what it means to do research (in my field, Theoretical CS) seems to be shifting, and shifting fast. What to do? Senior researchers must lead by example, knowing that not everything will pan out. What I'm suggesting below may not work everywhere, but here's my own advice: 1/

Vertices are red Vertices are blue Graph's bipartite "k equals 2"

Realized how to frame my question as an optimization problem to apply gradient descent. It's all downhill from here.

Teaser: coming soon to an #arXiv near you! (my coauthors did not change the title in time)

Just LOVE the "Advanced Quantum Algorithms" lecture notes of Stacey Jeffery!!! homepages.cwi.nl/~jeffery/not... Everyone teaching quantum computing should read this paragraph out loud to their students! homepages.cwi.nl/~jeffery/not...

On the topic of online resources, worth spreading the word again about Ryan O'Donnell's "CS Theory Toolkit" course: "Covers a large number of the math/CS topics that you need to know for reading and doing research in Computer Science Theory" youtube.com/playlist?lis... @booleananalysis.bsky.social

I just gave a tutorial on Design Templates for Dynamic Graph Algorithms at IISc in Bangalore. The kindest words I received were "best tutorial I have listened to in the last 10 years." Hope it interests you. Video: www.youtube.com/live/L8ev24g... Slides: tinyurl.com/yetx3vxu

In optimization problems, randomness thwarts complexity.

Open Printer: an open-source inkjet printer with no DRM, no subscriptions, and repairable parts. Sometimes the best innovation is just making things work the way they should have all along.

Today at IAS, I gave a 2 hr 15 mins lecture on why TIME[t] is in SPACE[√(t log t)]. You can watch it here! www.youtube.com/watch?v=ThLv...

You likely have a world model running inside your skull right now — it’s how you know not to step in front of a moving train without needing to run the experiment first. So far, AI lacks such a scaled-down representation of the environment.

"The day the paper was published should have been a moment of pride. Instead, it felt like a quiet erasure." #ScienceWorkingLife https://scim.ag/4p3eH5g

To all the people mocking LLMs because it's "just matrix multiplication (linear algebra):" Careful there! You're going to piss off the quantum physicists

Thorsten Altenkirch explains Gödel's Incompleteness Theorem on @computerphile.bsky.social, and shows some definitions in #LeanLang! 🎯 Watch here: www.youtube.com/watch?v=IuX8...

After 3 1/2 years of work my course on quantum computing is finally finished — the "Director's Cut" of Understanding Quantum Information and Computation is now available. arxiv.org/abs/2507.11536

Reminder/plug: my graduate-level monograph on "Topics and Techniques in Distribution Testing" (FnT Comm. and Inf Theory, 2022). 📖 ccanonne.github.io/survey-topic... [Latest draft+exercise solns, free] 📗 nowpublishers.com/article/Deta... [Official pub] 📝 github.com/ccanonne/sur... [LaTeX source]

This lecture provides a gentle introduction to amortized analysis. For experts: At the end, I explained Hollow Heaps, an optimal heap like Fibonacci heaps, but simpler! Surprisingly, I have not seen video lectures on this before. www.youtube.com/watch?v=8mHa...

Markus Himmel has written a blog post about how to write a simple imperative program in Lean and then how to verify that the program is bug-free. markushimmel.de/blog/my-firs...

📣 We're excited to share the new lean-lang.org! Relaunching our website was a key deliverable in our Year 2 roadmap to provide "improved navigation and access to valuable content, resources, and tools." We hope you like it! #LeanLang #LeanProver

I finally understand the mechanism of the Jacquard loom. Still cannot fathom how designers program the holes. youtu.be/pzYucg3Tmho

Graph theorist Maria Chudnovsky proved the strong perfect graph theorem, which was proposed back in the 1960s. Tune in to “The Joy of Why” with co-host @jannalevinastro.bsky.social:

Our ICALP 2025 paper is now available here! We present the first example of a locally checkable labeling problem that becomes much easier to solve with distributed algorithms if you have access to shared randomness. doi.org/10.4230/LIPI...