Yotam Gafni retweeted
פרסום ראשון
תקרית חריגה ביותר - אדם זר התקרב ליו״ר הדמוקרטים כשברשתו סכין.
במהלך סיור המרצת מצביעים של יו”ר הדמוקרטים, יאיר גולן בפארק המסילה בתל אביב, התקרב אליו אדם זר. מאבטחיו של גולן חסמו אותו וכשהתקרבו אליו, נשמטה סכין מתוך בגדיו ונפלה על הקרקע.
המאבטחים השתלטו עליו מיד. למקום הוזעקה מיד משטרה והוא נעצר.
Yotam Gafni retweeted
In our Nature paper, we introduce the first superhuman Stratego AI, which we built using general techniques that we developed for RL & test-time compute under imperfect information. 1/N
Yotam Gafni retweeted
Given a set of n points in d dimensions, the problems of finding the furthest pair and the closest pair require no explanation even to laymen. However, while finding the closest pair has a much more efficient algorithm,
I'd thought about fine-grained complexity of Furthest Pair for some time. Especially exciting to see AI-assisted discovery & algebraic number theory showing up (again!). Congrats to @B1ar2n3a, Yinzhan Xu, and Christopher Ye — hoping for many more such uses of these tools in TCS!
Yotam Gafni retweeted
How do onchain markets actually work?
D²’s DeFi Microstructure track covers the mechanics behind latency, fees, staking, and block building:
→ Latency races on blockchains: Brian Zhu
→ Fee mechanisms under execution uncertainty: Sarisht Wadhwa
→ Liquid staking and policy limits: Fayçal Drissi
→ EVM workloads in the wild: Jason Milionis
→ Ethereum block-building resilience: Sen Yang
Yotam Gafni retweeted
📣 Introducing Easy Peasy, an EC workshop focused on simple, elegant, teachable results! Do you have a result that is so self-contained and easy to communicate that you could explain all the details in under 15 minutes? Then this is the venue for you!
Yotam Gafni retweeted
In my doctorate, I proved the Erdős Primitive Set Conjecture, showing that the primes themselves are maximal among all primitive sets.
This problem will always be in my heart: I worked on it for 4 years (even when my mentors recommended against it!) and loved every minute of it.
[Primitive sets are a vast generalization of the prime numbers: A set S is called primitive if no number in S divides another.]
Now Erdős#1196 is an asymptotic version of Erdős' conjecture, for primitive sets of "large" numbers.
It was posed in 1966 by the Hungarian legends Paul Erdős, András Sárközy, and Endre Szemerédi.
I'd been working on it for many years, and consulted/badgered many experts about it, including my mentors Carl Pomerance and James Maynard.
The the proof produced by GPT5.4 Pro was quite surprising, since it rejected the "gambit" that was implicit in all works on the subject since Erdős' original 1935 paper. The idea to pass from analysis to probability was so natural & tempting from a human-conceptual point of view, that it obscured a technical possibility to retain (efficient, yet counter-intuitve) analytic terminology throughout, by use of the von Mangoldt function \Lambda(n).
The closest analogy I would give would be that the main openings in chess were well-studied, but AI discovers a new opening line that had been overlooked based on human aesthetics and convention.
In fact, the von Mangoldt function itself is celebrated for it's connection to primes and the Riemann zeta function--but its piecewise definition appears to be odd and unmotivated to students seeing it for the first time. By the same token, in Erdős#1196, the von Mangoldt weights seem odd and unmotivated but turn out to cleverly encode a fundamental identity \sum_{q|n}\Lambda(q) = \log n, which is equivalent to unique factorization of n into primes. This is the exact trick that breaks the analytic issues arising in the "usual opening".
Moreover, Terry Tao has long suspected that the applications of probability to number theory are unnecessarily complicated and this "trick" might actually clarify the general theory, which would have a broader impact than solving a single conjecture.
This is one of the coolest such examples! See comments from Lichtman below, who proved the related primitive set conjecture arxiv.org/abs/2202.02384
Yotam Gafni retweeted
If you like chess but find the game overwhelming, you might enjoy the new game I made. It's a regular game of chess but you can only choose one of three moves corresponding to ~700, ~1500 and ~3000 ELO. Your challenge is to figure which one is the best move. Link below
Yotam Gafni retweeted
Gamblers trying to win a bet on Polymarket are vowing to kill me if I don’t rewrite an Iran missile story
This is my account:
timesofisrael.com/gamblers-t…
Yotam Gafni retweeted
Our co-founder Terence Tao is announcing SAIR Foundation's inaugural competition: the Mathematics Distillation Challenge.
Co-organized by @damekdavis, Terence Tao, and SAIR Foundation.
competition.sair.foundation/…
Yotam Gafni retweeted
This right here is the real ergodicity economics.
Sandomirskiy and Tamuz took a result inspired by some kind of decision theory and came to a very neat result about physics, now published in a math journal.
Yotam Gafni retweeted
Submit a bug-free paper to ICML today using Refine.
The first 30 verifiable AI/ML researchers to reply "try refine" get a free full review (tons of compute, $50 retail).
Refine is a tool for deep review of scientific manuscripts.
1/
Yotam Gafni retweeted
A new blog post by @AcerFur, describing his experience as a pioneer of using AI tools to solve Erdős problems:
erdosproblems.com/forum/thre…
Yotam Gafni retweeted
Paata Ivanisvili (@PI010101), Terry Tao, and I started a new repository of "Optimization constants in mathematics" that anyone can use to benchmark AI models or just make progress on by any means. Examples already in the repo include the Grothendieck constant, Berry-Esseen constant, the matrix multiplication exponent, the cap set constant, and several others. We’re hoping to crowdsource a high-quality list of such constants and ultimately turn this into a website with a thriving community of contributers, similar to the “Erdos Problems” website.
Currently we’re hosting the site on github. I’ve put the link to the repo below. The repo includes instruction on how to make a contribution. Please let us know any suggestions for improvement!
Yotam Gafni retweeted
Designing DeFi: Protocols & Incentives ✨
An academic conference dedicated to research on the design, analysis, & evaluation of DeFi protocols
Where → Columbia Business School
When → May 20 - 21
Papers due → February 14
Learn more ↓
designingdefi.xyz
Yotam Gafni retweeted
If you do applied math (broadly - CS, stats, physics, . . .) - a request/freebie:
Refine is a tool that reads papers and finds technical issues, like a referee.
We want researchers in diverse areas to try it.
If you're willing to, read on.
1/
Yotam Gafni retweeted
🎄🎁 Special Gift 🎁🎄
To anyone who proves this conjecture in game theory & number theory, unresolved for 10+ years.
Formalized mostly by Aristotle @HarmonicMath w/ help by GPT and Deep Think in @leanprover and now available in @GoogleDeepMind Formal Conjectures repo 1/
Yotam Gafni retweeted
When Claude learns this trick, there’s gonna be psychosis on a scale the world hasn’t seen since the dancing plague of 1518
Yotam Gafni retweeted
Times are changing. From the acknowledgments of
@fortnow's new paper on search vs decision for S_2^P. (arxiv.org/abs/2512.02808)
Yotam Gafni retweeted
Preprint on using ChatGPT to resolve a 42-year-old open problem (point convergence of Nesterov’s accelerated gradient method) is out.
Mathematical results are complete, though still need to expand the discussion of historical context & prior work.
(1/2)
arxiv.org/abs/2510.23513































