Mohamed Soussi (@modsoussi) header
Mohamed Soussi (@modsoussi) profile picture

☪️ | Engineer

Earth
Joined July 2009
Photo by Mohamed Soussi (@modsoussi)Photo by Mohamed Soussi (@modsoussi)Photo by Mohamed Soussi (@modsoussi)Photo by Mohamed Soussi (@modsoussi)Photo by Mohamed Soussi (@modsoussi)Photo by Mohamed Soussi (@modsoussi)Photo by Mohamed Soussi (@modsoussi)Photo by Mohamed Soussi (@modsoussi)Photo by Mohamed Soussi (@modsoussi)Photo by Mohamed Soussi (@modsoussi)
Mohamed Soussi retweeted
This is what I was looking for:
If the Generalized Riemann Hypothesis (the stronger version of the Riemann Hypothesis) is proven, these become proven facts: Algorithms that no longer need randomness - Primality testing: Miller's fast test becomes proven correct with no randomness - Square roots mod a prime: becomes solvable fast and with no coin flips (today that's an open problem) - Cube roots and other roots mod a prime: same. - Factoring polynomials over finite fields: almost fast (quasi-polynomial) with no randomness, instead of needing randomness - Building finite fields: you can construct any finite field directly, with no random search - Factoring vs. φ(n): factoring a number becomes provably as easy as computing φ(n), even without randomness - Primes with a given remainder: a prime with any allowed remainder mod q exists that's at most about q², so searching for one is fast Complexity theory - Polynomial equations: "does this system of equations have a solution?" drops from PSPACE to a much lower class (AM) - Algebraic P vs NP: Valiant's algebraic version of P vs NP gets tied to the normal P vs NP over the complex numbers - Turing machines: a known 744-state Turing machine is proven to run forever Number theory software - Math libraries: PARI/GP and Magma results computed "assuming GRH" become fully proven - Class groups: algorithms that compute these number-field structures get guaranteed running times - Elliptic curve generation: the algorithms used to create curves for crypto get guaranteed running times Cryptography (no new attacks, only proofs) - Elliptic curves: proven that if discrete log is hard on one curve, it's hard on almost all similar curves - Lattice crypto: known quantum attacks on some lattice schemes become proven to work - Isogeny crypto: known quantum attacks on some isogeny schemes get proven speeds - Code-based crypto: schemes like BIKE get the guarantee that the special primes they need exist Prime gaps - Next prime: there's always one within about √p·log p of p, so "find the next prime" has a guaranteed worst case What it does NOT do - It doesn't solve P vs NP - It doesn't make factoring easy, so RSA and elliptic-curve crypto stay safe - It doesn't make anything faster in practice, because randomized versions already work today - Ramanujan graphs, expanders and AG codes are unaffected: they use a finite-field version of RH that was proven decades ago
3
16
477
111,386
Mohamed Soussi retweeted
biggest day in the history of mathematics, weeks after the previous biggest day in the history of mathematics. buckle up
9
24
2
410
9,793
Mohamed Soussi retweeted
Guys, this is very serious and you have to read this right now. The Riemann Hypothesis may have just been solved, and if the claim holds, it's an insane achievement. In mathematics there is a famous problem called the Riemann Hypothesis, and it's about prime numbers. Primes are numbers like 2, 3, 5 and 7 that can only be divided by 1 and themselves. Every other number is built by multiplying them together, so they're the building blocks of all numbers. You can never tell exactly where the next prime will show up, but if you step back, there's a pattern. Around 1,000, about 1 in 7 numbers is prime. Around a million, about 1 in 14. Around a billion, about 1 in 21. Primes get rarer at a steady, predictable pace. Because of that pattern, mathematicians can estimate how many primes there are below any number. But the estimate is never exactly right. It's always a little off, and the big question is how far off it can get. Think of flipping a coin 1,000 times. You expect 500 heads, but you'll get something like 480 or 520. It's a little off, but never wildly, and you can predict how far off it will be. In 1859 a mathematician named Bernhard Riemann found that the prime estimate's error isn't random. It's controlled by a hidden set of special numbers. Where those numbers sit decides how big the error gets. Riemann guessed that every single one of them sits on one straight line. If he's right, the error always stays small, just like the coin, and primes are as orderly as they could possibly be. If even one of those numbers is off the line, the error can grow much bigger, and primes are far messier than we think. So far computers have found trillions of these special numbers, and every single one is on the line. But there are infinitely many, so checking will never be enough. You need a proof that covers all of them at once. For 167 years nobody has found one. It's one of the seven hardest unsolved problems in mathematics, with a million dollar prize attached. Now a mathematician has posted a note saying that, working with Claude, he believes he has that proof. He says a computer has already checked every step, and that Claude raced ahead of him near the end. Experts still need to confirm it, but this isn't a random internet claim. If it holds, it doesn't mean we can predict every prime. It means we finally know the pattern can never go wildly wrong. Thousands of math papers that begin "assuming the Riemann Hypothesis is true" become proven fact overnight. We'd also get firm limits on how far apart primes can be, and a guarantee that a fast method for testing whether a huge number is prime always works. And no, your bank account isn't in danger. Online security depends on how hard it is to break a huge number into its prime factors, and this proof doesn't make that any easier. If anything, it gives the math behind encryption a stronger foundation. If it holds, this is bigger than one math problem. A question that beat the greatest minds in history for 167 years would have been cracked by a human and an AI in a matter of weeks. If AI can find answers and computers can check them, the limit on science is no longer how smart we are. It's how many good questions we can ask.
JUST IN: Riemann Hypothesis has been solved. alpo.ge/remark.pdf
453
2,781
386
29,555
2,924,376
JUST IN: Riemann Hypothesis has been solved. alpo.ge/remark.pdf
1,817
8,090
5,363
61,081
15,196,759
Mohamed Soussi retweeted
SITUATION DETECTED: Anthropic mathematician Levent Alpöge, working together with Claude, says he has discovered a proof of the Riemann Hypothesis, the most famous open problem in mathematics.
29
142
35
2,252
176,403
Lean Into Genocide.
Replying to @derJamesJackson
To this end, Tompson networked in WhatsApp groups reportedly including powerful figures like Sheryl Sandberg, Gary Tran, Bill Ackman, Sean Maguire and David Marcus.
10
1
60
2,571
Who would have thought 🤷‍♂️
Exclusive: leaked documents show how Silicon Valley elites funded @visegrad24 more than a million dollars as “part of the Israeli PR” as well as the influential pseudo-news organisation’s own cynical motivations My investigation for @WIRED 🧵
27
Mohamed Soussi retweeted
satrançla zekanın çok da alakalı olmadığının kanıtı
18
24
8
524
35,344
Mohamed Soussi retweeted
Ship 42 is the best wallpaper I’ve ever seen. You can use whatever you want. @elonmusk
Readers added context they thought people might want to know
These photos are AI edited, these photos were taken actually by @johnkrausphotos, @elonmusk, @spacex and other X accounts. Examples below: x.com/johnkrausphoto… x.com/johnkrausphoto… x.com/johnkrausphoto…
179
482
48
5,197
366,744
Mohamed Soussi retweeted
L’Europe est une grande puissance spatiale. Elle n’est pas du tout absente de la compétition mondiale.
11
43
1
289
11,826
Mohamed Soussi retweeted
Habibi wake up, we're calling moustaches antisemitism these days 😂 A real post Istg
276
1,952
129
18,980
270,836
Mohamed Soussi retweeted
Jensen Huang faced harsher consequences than everyone named in the Epstein files combined.
277
6,849
106
62,257
705,446
Mohamed Soussi retweeted
Marco Rubio @marcorubio is a piece of shit.
A Christian priest from Bethlehem, the birthplace of Jesus, says the US denied him a visa because he is Palestinian. Father Issa Thaljieh had been invited to speak at an American church about life under Israeli occupation.
76
500
16
4,140
142,670
can't stop watching this. we can just do things. it's more important than ever that we do.
Mechazilla catches Starship! Congratulations to the entire SpaceX team on this incredible achievement!
21
kinda obvious when you look at things from this lens
Jensen Huang has faced more consequences than virtually anyone in the Epstein Files.
27
Mohamed Soussi retweeted
That drone shot orbiting the tower set to ‘Baby Come Back’ felt like something out of For All Mankind. The parallels won’t end here.
30
141
5
4,330
65,711
What a time to be alive. Hopefully the rest of the world catches up.
On Friday, November 13, Starship lifted off from Starbase, Texas on its 15th flight. On Saturday, November 14, Starship returned to Starbase, Texas, and changed everything → spacex.com/launches/starship…
18
Mohamed Soussi retweeted
just like that dirt cheap high orbit was opened to humankind. if we were playing civilization a tech tree node unlock would be flashing in everyone’s HUDs
Mechazilla catches Starship! Congratulations to the entire SpaceX team on this incredible achievement!
97
320
19
5,502
133,028
Mohamed Soussi retweeted
Mechazilla catches Starship! Congratulations to the entire SpaceX team on this incredible achievement!
6,799
27,375
9,115
141,317
17,695,629
Mohamed Soussi retweeted
ce qui est génial avec la panne de microsoft c’est que les français réalisent que le concept de colonie numérique est une réalité très concrète
51
180
10
1,207
37,300