Pinned Tweet
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.
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.
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.
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.
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.
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.
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.
Hasn't been 2 Complete days since GTA 6 released.
Now modders are bringing it on PC within 4 days.
After the GTA 6 Xbox port leaked, modders reckon it will be playable in mere days pcgamer.com/games/grand-thef…
6
456
I was working on a idea of discovering new branch of physics and I worked alongside gemini neon in writing this paper that does indeed falsifies few existing theories and shows some origin to some of the new ideas.
Some of the glimpses that I got from it within a thesis :
To find the average energy per memory access, you multiply how often you need the k-th byte by how far away it is, and sum it up from 1 to infinity.
When you run that basic integral, you don't get a smooth curve , you hit a hard cliff at
αc = 1 + 1/d
In 2D (flat chips):
The cutoff is α = 1.5.
In 3D (3D-stacked chips):
The cutoff is α = 1.33.
What this actually means:
If your workload's locality is above the cutoff (α > 1.5 in 2D), you can add infinite memory and your average energy and latency stay capped at a finite number. You win.
If your workload is below the cutoff (α < 1.5 in 2D), every time you scale up memory, your energy and latency explode toward infinity.
No amount of clever software can save you. you have hit a physical scaling wall.
Maxirex retweeted
Built this Max Payne like Diving System with Gemini Neon.
this might be the only model out of all that I have worked with which came this close.
Built this Max Payne like Diving System with Gemini Neon.
this might be the only model out of all that I have worked with which came this close.











