Maxirex (@Maxirex26) header
Maxirex (@Maxirex26) profile picture

17 | Science - Systems - Statistics Breaking down hard Math , AI and Systems from the ground up.

Joined May 2026
Photo by Maxirex (@Maxirex26)Photo by Maxirex (@Maxirex26)Photo by Maxirex (@Maxirex26)Photo by Maxirex (@Maxirex26)Photo by Maxirex (@Maxirex26)Photo by Maxirex (@Maxirex26)Photo by Maxirex (@Maxirex26)Photo by Maxirex (@Maxirex26)Photo by Maxirex (@Maxirex26)Photo by Maxirex (@Maxirex26)
For those who dont know what Reimann Hypothesis means : Prime numbers (2, 3, 5, 7, 11…) are the building blocks of all numbers, and up close they seem to pop up completely randomly. However, if you zoom way out, we actually have a smooth formula that estimates roughly how many primes exist up to any huge number and it’s just never exact. ​In 1859, a mathematician named Bernhard Riemann found a way to turn the prime numbers into a 2D map filled with special "zero" points, where each point acts like a wave that controls how far off our estimate can get. The Riemann Hypothesis is the claim that every single one of those special points lines up on one exact straight line, with zero exceptions, all the way to infinity. If that’s true, it guarantees that prime numbers never clump up or vanish in weird ways and they stay spread out as cleanly and evenly as random coin flips, forever.
184
854
91
8,962
1,596,952
For those who don't know what P vs NP means (the one Millennium Problem that could change the world overnight) : ​Some problems are brutally hard to solve, yet effortless to check. Imagine a massive 1,000-piece jigsaw puzzle or a giant Sudoku finding the solution from scratch could take you days, but if someone hands you the finished board, you can verify it’s right in seconds. ​In computer science, problems that are fast to solve are called P, and problems whose answers are fast to check are called NP. The P vs NP question simply asks: if a computer can quickly verify an answer, does that mean there’s always a clever shortcut to find the answer just as fast? ​Unlike the Riemann Hypothesis, proving P = NP would change the entire world by next morning. Every piece of modern internet encryption , banking, passwords, crypto would break overnight, because security relies on problems being hard to solve. At the exact same time, we could instantly crack protein folding, design new medicines, and solve the hardest logistics problems on Earth in seconds.
119
215
26
2,748
258,256
4 February 2027
3
1
63
8,722
Maxirex retweeted
For those who don't know what Lean is (and how a 17-million-line math proof just got verified in 24 hours) : ​Normally, when someone claims they solved a massive math problem, it takes top human mathematicians years to read a 500-page paper line by line, hunting for one tiny hidden mistake. ​Lean is a programming language built for pure math. Instead of writing proofs in English on paper, you write every single logical step as strict code. If even one tiny jump in logic is shaky or hand-waved, the code simply refuses to compile. ​That’s why the community could verify a 17-million-line proof of the Riemann Hypothesis in a single day. You don't have to trust the author, the AI, or manually read every line and you just check that the final equation matches the actual problem, run the compiler, and if it passes, the math is 100% airtight. Levent Alpöge is now on a generational run.
4
6
52
2,849
The mathematician who secretly proves P = NP and decides not to publish the paper :
For those who don't know what P vs NP means (the one Millennium Problem that could change the world overnight) : ​Some problems are brutally hard to solve, yet effortless to check. Imagine a massive 1,000-piece jigsaw puzzle or a giant Sudoku finding the solution from scratch could take you days, but if someone hands you the finished board, you can verify it’s right in seconds. ​In computer science, problems that are fast to solve are called P, and problems whose answers are fast to check are called NP. The P vs NP question simply asks: if a computer can quickly verify an answer, does that mean there’s always a clever shortcut to find the answer just as fast? ​Unlike the Riemann Hypothesis, proving P = NP would change the entire world by next morning. Every piece of modern internet encryption , banking, passwords, crypto would break overnight, because security relies on problems being hard to solve. At the exact same time, we could instantly crack protein folding, design new medicines, and solve the hardest logistics problems on Earth in seconds.
2
7
220
30,878
For those who don't know what Lean is (and how a 17-million-line math proof just got verified in 24 hours) : ​Normally, when someone claims they solved a massive math problem, it takes top human mathematicians years to read a 500-page paper line by line, hunting for one tiny hidden mistake. ​Lean is a programming language built for pure math. Instead of writing proofs in English on paper, you write every single logical step as strict code. If even one tiny jump in logic is shaky or hand-waved, the code simply refuses to compile. ​That’s why the community could verify a 17-million-line proof of the Riemann Hypothesis in a single day. You don't have to trust the author, the AI, or manually read every line and you just check that the final equation matches the actual problem, run the compiler, and if it passes, the math is 100% airtight. Levent Alpöge is now on a generational run.
4
6
52
2,849
Maxirex retweeted
For those who don't know what P vs NP means (the one Millennium Problem that could change the world overnight) : ​Some problems are brutally hard to solve, yet effortless to check. Imagine a massive 1,000-piece jigsaw puzzle or a giant Sudoku finding the solution from scratch could take you days, but if someone hands you the finished board, you can verify it’s right in seconds. ​In computer science, problems that are fast to solve are called P, and problems whose answers are fast to check are called NP. The P vs NP question simply asks: if a computer can quickly verify an answer, does that mean there’s always a clever shortcut to find the answer just as fast? ​Unlike the Riemann Hypothesis, proving P = NP would change the entire world by next morning. Every piece of modern internet encryption , banking, passwords, crypto would break overnight, because security relies on problems being hard to solve. At the exact same time, we could instantly crack protein folding, design new medicines, and solve the hardest logistics problems on Earth in seconds.
119
215
26
2,748
258,256
Maxirex retweeted
So what actually changes if the Riemann Hypothesis gets proven? ​Honestly, nothing breaks tomorrow and your bank passwords won't suddenly stop working. The real payoff is much bigger: ​1. Right now, huge chunks of modern math are built on "assuming the Riemann Hypothesis is true." A proof turns all of those assumptions into rock-solid facts. ​2. Knowing the exact limits of how primes behave lets us tighten up the math behind prime-testing, encryption, and large-scale computing. So faster and sharper algorithms. ​3. A bridge to quantum physics. Strangely, the spacing of Riemann's zeros matches the energy levels of chaotic quantum systems. Cracking this could hand physicists a new map to the quantum world. ​4. The real prize is the machinery. Just like useless pure number theory eventually gave us modern internet security, the new math and the AI + human reasoning workflows invented to crack this will spill over into physics, engineering, and computing for decades.
For those who dont know what Reimann Hypothesis means : Prime numbers (2, 3, 5, 7, 11…) are the building blocks of all numbers, and up close they seem to pop up completely randomly. However, if you zoom way out, we actually have a smooth formula that estimates roughly how many primes exist up to any huge number and it’s just never exact. ​In 1859, a mathematician named Bernhard Riemann found a way to turn the prime numbers into a 2D map filled with special "zero" points, where each point acts like a wave that controls how far off our estimate can get. The Riemann Hypothesis is the claim that every single one of those special points lines up on one exact straight line, with zero exceptions, all the way to infinity. If that’s true, it guarantees that prime numbers never clump up or vanish in weird ways and they stay spread out as cleanly and evenly as random coin flips, forever.
20
102
5
611
75,223
So what actually changes if the Riemann Hypothesis gets proven? ​Honestly, nothing breaks tomorrow and your bank passwords won't suddenly stop working. The real payoff is much bigger: ​1. Right now, huge chunks of modern math are built on "assuming the Riemann Hypothesis is true." A proof turns all of those assumptions into rock-solid facts. ​2. Knowing the exact limits of how primes behave lets us tighten up the math behind prime-testing, encryption, and large-scale computing. So faster and sharper algorithms. ​3. A bridge to quantum physics. Strangely, the spacing of Riemann's zeros matches the energy levels of chaotic quantum systems. Cracking this could hand physicists a new map to the quantum world. ​4. The real prize is the machinery. Just like useless pure number theory eventually gave us modern internet security, the new math and the AI + human reasoning workflows invented to crack this will spill over into physics, engineering, and computing for decades.
For those who dont know what Reimann Hypothesis means : Prime numbers (2, 3, 5, 7, 11…) are the building blocks of all numbers, and up close they seem to pop up completely randomly. However, if you zoom way out, we actually have a smooth formula that estimates roughly how many primes exist up to any huge number and it’s just never exact. ​In 1859, a mathematician named Bernhard Riemann found a way to turn the prime numbers into a 2D map filled with special "zero" points, where each point acts like a wave that controls how far off our estimate can get. The Riemann Hypothesis is the claim that every single one of those special points lines up on one exact straight line, with zero exceptions, all the way to infinity. If that’s true, it guarantees that prime numbers never clump up or vanish in weird ways and they stay spread out as cleanly and evenly as random coin flips, forever.
20
102
5
611
75,223
My Superintelligent Agent trying to impress his Crush from Claude Code CLI
Hear me out: “Singularity dot Com”, a dating site for digital superintelligences …
1
7
861
If you are wondering What Good Solving the Reimann Hypothesis gonna do? Mathematicians and computer scientists have already assumed it was true for decades. The point here is that in math, the machinery built to crack an impossible problem is almost always more valuable than the answer itself (which in this case is Anthropic's Claude or simply AI). Number theory was considered completely useless for 2,000 years and until it became the foundation of modern internet security. Riemann’s own geometry from the 1850s seemed purely abstract up until Einstein used it for General Relativity, which your GPS relies on today. Because the Riemann zeros mysteriously mirror the energy levels of quantum chaotic systems (like heavy atomic nuclei), the techniques used to prove it could unlock new breakthroughs in quantum physics and signal processing.
6
20
4
191
21,793
Anthropic and Claude to the rest of AI Competition after Navier stokes and Reimann hypothesis :
1
12
1,618
How Anthropic and Levent Alpöge has been moving for last 3 months. - Solved Navier Strokes Equation (millennium problem solved in September) - Solved riemann hypothesis(millennium problem solved in November) 2 millennium problems solved in 3 months of Span. Claude might just be the greatest research LLM to ever exist.
3
27
4,533
Hasn't been 2 Complete days since GTA 6 released. Now modders are bringing it on PC within 4 days.
8
524
Going from LTE to NR SA.
1
2
185
" 'What' aint no number i ever heard of" 😭 Beej might the funniest C guide there is.
1
5
244