
bezrat hashem i get an h1b visa. I testify there is only one God. self proclaimed #mathtwt ambassador. follows not endorsements, twts are usually satire!
17, india
Joined August 2021
- Tweets9.7K
- Following1.1K
- Followers236
- Likes55.3K
c4darkness retweeted
While I do like competition, this sort of behavior of blatantly copying is not good.
I hope you do better next time. Even the previous promo images are the exact same as Canapè 😭
At least, glad that you reposted with updated images. But it shows your true intentions.
unavailable
c4darkness retweeted
Met someone who finds time to study, do extracurriculars and balance their personal life with their academics
c4darkness retweeted
The Lean FRO and Mathlib Initiative have released a joint statement on the Lean verification of the Riemann Hypothesis.
On November 20, Levent Alpöge released a proof of the Riemann Hypothesis as a Lean library of 17 million lines of code. Over the past day, the Lean and Mathlib communities worked together to verify it. The statement certifies the proof as correct and describes how it meets all necessary verification criteria.
Congratulations to Levent on this achievement, and thank you to everyone in the community who contributed to the verification.
Full statement: leanprover-community.github.…
c4darkness retweeted
redditors have found out how much was spent on Claude proving Riemann hypothesis and they're now complaining it should've been spent on math research
c4darkness retweeted
>be me
>125 iq, tell people it's 140
>open X
>guy's bio starts with "idiot."
>keep reading
>harvard valedictorian. morgan prize. society of fellows
>"1 hilbert problem so far"
>SO FAR
>literally has an asteroid named after him for a high school comp sci project
>july: tweets "hello there the jacobian conjecture is false thanx"
>thanks claude fable for working through the world cup final, drops the counterexample right in the tweet
>november: quietly uploads an unsigned 4 page pdf called remark.pdf, doesn't even tweet it
>proof of the riemann hypothesis
>generalized one on top!!
>extended one is next, he just needs more time
>texts his boss dario late sunday night: "hypothetically, if i were to have..."
>bro solved riemann in 250,000+ pages and is already disappointed it's too long
>the 20 step timeline of how he did it, dates aren't even in order
>same day he also claims navier-stokes
>two millennium problems in one friday
>bio still says "idiot."
>mfw 180 iq is the lowball estimate
c4darkness 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
c4darkness retweeted
SAT math when it comes to actually testing your mathematical abilities instead of memorizing how to be a Desmos regressions merchant
c4darkness retweeted
Replying to @jessesingal
Can you tell me how it improves your understanding of numbers?

































