Jacek (Jomsborg.eth) (@timelessdev) header
Jacek (Jomsborg.eth) (@timelessdev) profile picture

Viking from Jomsborg. The DAO investor. Applied math. Geometric quantization. Building reasoning layer.

jomsborg.eth
Joined January 2013
Photo by Jacek (Jomsborg.eth) (@timelessdev)Photo by Jacek (Jomsborg.eth) (@timelessdev)Photo by Jacek (Jomsborg.eth) (@timelessdev)Photo by Jacek (Jomsborg.eth) (@timelessdev)Photo by Jacek (Jomsborg.eth) (@timelessdev)Photo by Jacek (Jomsborg.eth) (@timelessdev)Photo by Jacek (Jomsborg.eth) (@timelessdev)Photo by Jacek (Jomsborg.eth) (@timelessdev)Photo by Jacek (Jomsborg.eth) (@timelessdev)Photo by Jacek (Jomsborg.eth) (@timelessdev)
Jacek (Jomsborg.eth) retweeted
Ok, it's finally time to start a serious digestion of the proof (because we finally know it is fully correct). I am mostly interested in the arithmetic geometry part (which is my field of expertise). And the proof is actually very clever and nice! I think it will take a couple of days before many experts in the field will build a deep understanding of the parts of this proof. What I find quite reassuring is that the elements of this proof are very standard and they are cleverly composed. It is very HUMAN mathematics after all!
We have a full confirmation from Andrew Sutherland who first managed to finish the nanoda kernel run and comparator in paranoid mode. This is now basically saying that the Riemann Hypothesis is 99,99999% true. It's almost impossible that any glitch has been deliberately implemented into the code and that anything is missing from the proof artifact (no sorries, no additional axioms, no weird bugs).
26
136
26
1,186
73,052
Jacek (Jomsborg.eth) retweeted
🚨 JUST IN: Turkish-American mathematician Levent Alpöge, working with Claude, claims to have proved one of the hardest problems in mathematics: the Generalized Riemann Hypothesis! The Riemann Hypothesis is one of the seven Millennium Prize Problems. The announcement includes a massive Lean formalization, which, when written out in English, runs to over 250,000 pages! 🤯 If verified, this could be the most significant mathematical breakthrough achieved with AI to date.
93
275
111
2,487
286,887
Jacek (Jomsborg.eth) retweeted
Holy shit. Levent Alpöge from Anthropic just claimed Claude has resolved the General Reimann Hypothesis!!! Proof is 250,000+ pages long. Lean is released. GRH is the 2nd of 6 Millenium prizes solved by AI, after Navier-Stokes. This may be the biggest AI math result of all time.
201
353
193
4,103
442,636
Jacek (Jomsborg.eth) retweeted
$ANT - ANTHROPIC MATHEMATICIAN CLAIMS CLAUDE SOLVED 167-YEAR-OLD RIEMANN HYPOTHESIS Anthropic mathematician Levent Alpöge claims to have proved the Riemann Hypothesis and its more ambitious generalization using Claude AI. The proposed proof was formalized in Lean, a mathematical verification system. Independent validation remains pending. If confirmed, it would mark a historic breakthrough in mathematics and AI-driven scientific discovery.
80
82
49
828
185,569
Jacek (Jomsborg.eth) retweeted
Frobenius structures! (aka the most beautiful things in math and physics)
4
49
2
498
22,037
Jacek (Jomsborg.eth) retweeted
Chess is tough 💔 #TotalChess
1
1
18
5,725
Jacek (Jomsborg.eth) retweeted
Software the whole world runs on today, made by Europeans: Linux 🇫🇮 Git 🇫🇮 Python 🇳🇱 PHP 🇩🇰 C++ 🇩🇰 TypeScript 🇩🇰 Ruby on Rails 🇩🇰 MySQL 🇸🇪 Erlang 🇸🇪 Pascal 🇨🇭 The Web 🇬🇧 Europe didn't fail at building tech. It failed at keeping the companies.
549
908
116
11,066
480,370
Jacek (Jomsborg.eth) retweeted
Astra 6.2 found an expected O(n^25) algorithm for uniform Latin Square sampling. No polynomial-time algorithm was known before. Research notes and paper: github.com/Mira-Cult/math/tr…
Problem 0353: Efficient Uniform Latin Square Sampling Is there an algorithm that samples uniformly from all labeled Latin squares of order n in expected polynomial time?
16
68
10
957
103,969
Jacek (Jomsborg.eth) retweeted
Kurt Gödel left 1,009 pages of unpublished mathematical notebooks. In a newly reported study, Jan von Plato used Claude to examine their contents. AI identified 663 theorem candidates, with about 400 reportedly verified as stated using Coq. The notebooks may also contain a near-proof anticipating Paul Cohen's work on the axiom of choice. An extraordinary discovery in mathematical history, though independent examination of the results is still needed.
9
59
5
305
15,601
Jacek (Jomsborg.eth) retweeted
Robert Kubica in 2010 Singapore GP using one hand to overtake. 🔥
17
131
11
3,375
208,542
Jacek (Jomsborg.eth) retweeted
HUGE RESULT FOR FORMALIZATION! in only 6h, using relatively modest compute capacity, the Grothendieck-Riemann-Roch theorem was fully verified in Lean by orchestrating a couple hundreds of agents. this is one of the main results of Alexander Grothendieck, and arguably the best result in term of a single theorem. the entire codebase is made open source, but also the processes by which the verification was done. this provides not only a result, but the reasoning behind it. this was made possible in such a short time because a lot of the components needed from algebraic geometry were made public by @axiommathai and in this spirit, i highly encourage these kinds of initiatives of open-sourcing the basic modules of the core fields of maths: algebra, geometry, number theory, and others. this will be useful not only for the formalization of known results, but also in enabling the inference of new results which can be verified fast enough.
13
31
5
209
10,810
Jacek (Jomsborg.eth) retweeted
12
71
15
915
25,505
Jacek (Jomsborg.eth) retweeted
🇳🇴Magnus Carlsen: “One of the best players in the world Abdusattorov got me a little bit back to reality” Magnus Carlsen on how training with Nodirbek Abdusattorov helped him get back into the rhythm of over-the-board chess: “It was really good to get some practice. And most of the games that I play are kind of casually online, and then you do develop some bad habits, I would say. And you kind of get a little bit back to reality by playing one of the best players in the world. [Question: Why Abdusattorov?] It was like a little bit random. But he was super nice. And my son really liked him as well. They had a huge mutual admiration. So that was super nice.”
3
23
4
586
49,986
Jacek (Jomsborg.eth) retweeted
NU7 has successfully activated on mainnet. A new era of Zcash is here. $ZEC
85
168
57
881
57,626
Jacek (Jomsborg.eth) retweeted
$QNT | Quant's partner Nexi Group nexigroup.com/content/dam/co…
1
13
5
74
4,073
Jacek (Jomsborg.eth) retweeted
18 years ago, on Oct 31 2008, Satoshi Nakamoto published the bitcoin whitepaper. MUST READ!
130
533
38
3,712
197,638
Jacek (Jomsborg.eth) retweeted
In 1936, mathematician Stanisław Mazur offered a live goose to anyone who solved Problem 153 in the Scottish Book. Thirty-six years later, Per Enflo solved it. Mazur kept his promise and presented the goose in 1972. The original handwritten problem and the award photograph survive.
2
3
64
7,753
Jacek (Jomsborg.eth) retweeted
Everyone is aware of P-vs-NP. Today, with UCLA Math+AI, we @yukonresearch are bringing multiplayer high-frequency research towards resolving this problem with circuitbreaker. The goal is to establish a superpolynomial circuit lower bound for one fixed NP problem, which would establish P ≠ NP. Thanks to the legendary cryptographer Amit Sahai for helping us in formulating the problem. Go work with your agents and contribute towards resolving P-vs-NP yukon.org/circuitbreaker
New challenge on Yukon: Circuit Breaker yukon.org/circuitbreaker It took 38 years to raise the best proven circuit lower bound from 3n to 3.1n. Days before this launch, an AI model pushed it to 3.5n. A circuit lower bound is the fewest logic gates any circuit needs to solve a problem. Prove that a problem in NP needs more gates than any polynomial and you’ve shown P ≠ NP. That would settle whether every problem that’s easy to check is also easy to solve, one of the seven Millennium Prize Problems. We’re still far from that bound. Circuit Breaker, built with UCLA Math+AI, is where the push continues. “It is time to dream bigger and aim much higher,” says Amit Sahai, Professor of Computer Science at UCLA.
11
36
3
267
18,532
Jacek (Jomsborg.eth) retweeted
In case you missed it, integer factorization has been proven subexponential (deterministically, worst-case bound)! The hard work comes from Claude's version of the ETH refutation but it seems a little more had to be done to get this result for integer factorization.
22
102
12
942
58,257