I think math is dead.. It is a shame. I loved it so much. I have put all my bets on it. I found comfort in it.
It is sadly time to move on. It won't be easy! I centered my whole world around math.
3
1
401
Zeta. retweeted
1. LLMs are just stochastic parrots.
2. Fine, articulate parrots. Still just predicting the next word.
3. They can’t even multiply.
4. Fine, they can multiply. Try olympiad math.
5. Fine, they can compete. Try winning gold.
6. Fine, gold. Someone already knew the answers.
7. Fine, an open problem. Try a Millennium Prize Problem.
8. Fine, but it wasn’t Riemann.
9. Fine, Riemann. but did it understand the proof?
10…
Zeta. retweeted
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
Replying to @cyrnosofia
i read once, however i don't remember exactly where or even if this is true tbh
that builders in rome and other places made that observation that stones fall in tge same time but the educated told them
there eyes were the problem or something
149
we are doomed
Levent Alpöge (@__alpoge__ ) claims to have proved the Riemann hypothesis with the help of Claude, with an approach extending to the Generalized Riemann Hypothesis.
If verified, this could be a historic milestone for AI-assisted mathematics...
alpo.ge/remark.pdf
21
oh fuck
Levent Alpöge (@__alpoge__ ) claims to have proved the Riemann hypothesis with the help of Claude, with an approach extending to the Generalized Riemann Hypothesis.
If verified, this could be a historic milestone for AI-assisted mathematics...
alpo.ge/remark.pdf
23
good on him for not putting her in trouble
BUT
that should be the norm and the fact that it isn't and we praise, what I believe is just, speaks of how bad society is and the injustices the poor face
🇨🇳 A cleaner at an internet café in China accidentally knocked 5 computers to the floor and offered to pay the $1,500 in damage herself.
The owner checked the footage, found the table hadn't been properly secured, and thanked her for spotting the hazard instead.
More bosses like this, please.
Writer: Julie
74
if you are scared from foreign values so you ban them, either your values are weak or you can't prove them to be correct.
either way there shouldn't be a ban on any idea, but the way you fight them is to refute them.
16
و انه الجريمة الوحيدة اللي ليس لها مبرر تحت اي سياق تاني (مثلا القتل له مبرر و هو الدفاع عن النفس، الخ اي خريمة تانية برضو تكون "مباحة" في سياق اخر)
٣-اما التحرش، فهو مشدرجة واحدة و يختلف في حدته من اللي عمله المجرم في الصحبة و لكن أقل ما تقدر تسميه تحرش يستاهل العقاب
27
Replying to @Azora4 @salmukaimy
الصراحه هذا غباء
١-انا اول ما شفت الفيديو افتكرت قصدهم حاجة زي انه شتمها و اتهمها انها مش تمام او حاجة و اللي هو الصراحة تهمة مش قد كده و ساعتها الافراج عنه منطقي
٢-لو اغتصبها فلا هنا دي مصيبة، اشوف الاغتصاب اسوا جريمة ممكن حد يعملها لانسان تاني عشان الاثر النفسي للصحية
1
42














