Anu | bIm | π΅πΈ free paIestine π retweeted
If I've said it once then I've said it 1,000 times: Trump loves good looking winners who beat the establishment, because that is how he likes to think of himself. If you are charming and not openly antagonistic he's got all the time in the world for you.
Anu | bIm | π΅πΈ free paIestine π retweeted
The Filipino restaurant Iβm at has open mic karaoke. Thatβs a ranked lobby
Anu | bIm | π΅πΈ free paIestine π retweeted
Replying to @luvherout
This and Princess Diana holding AIDS patients hands in the hospital did so much to help destigmatize the virus
Anu | bIm | π΅πΈ free paIestine π retweeted
when you can stop a BALROG one-handed but your girl is mad at you so you gotta take it like a man until she gets it out of her system before resubmitting the regularly scheduled proposal for her hand in marriage and world domination
Anu | bIm | π΅πΈ free paIestine π retweeted
#TROPspoilers
berek taking a piss during elendil's speech to protest his unfair working conditions
Anu | bIm | π΅πΈ free paIestine π 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
Anu | bIm | π΅πΈ free paIestine π retweeted
The cuts to real life footage are genuinely frying me


















































