14 Followers
114 Following
57 Posts
Cryptography engineer at [big tech company].
Interested in Cryptography/TCS, small time wikpedia editor
He/him, speaks english/russian.
Slightly botched migration, used to be @sasha
nice silly note in my quantum information lecture notes
it is great that so many smart crypto people write cryptography books but I'm now looking through a third with typos at really inconvenient spots where it affects your understanding of something hard. I guess they're checking I was paying attention...
If you drag an emoji family with a string size of 11 into an input with maxlength=10, one of the children will disappear.
something fun about C++ is sometimes you see something that looks like a silly mistake in code but you need to check with like 5 people because it might just be one of those C++ things that's really weird and there's multiple blog posts worth of stuff to understand
google maps generally assumes i have a higher aversion to walking than I do but I strongly doubt there are people who think 1 less minute of walking on a 40 minute walk is worth another bus transfer.

ran into an interesting situation with Google Maps transit directions today:
I was trying to go an event relatively out in the suburbs, so GMaps told me to do a route that involves 3 buses and takes ~2 hours.

The recommended ~2 hour route was "take ~1 hour of buses to get to the big bus station in this suburban town, then take a 25 minute bus and walk 40 minutes to the place.

Google maps recommended this over: "take the same ~1 hour of buses to the big bus station and then walk 41 minutes to the place"

GMaps added a whole extra bus transfer and 25 minutes to save 1 minute of walking! What a weird way to program this tradeoff.

As of today I have been meditating every (probably 98-99%) day for 2 years! #cool
Tamar Ziegler and I have just uploaded a short #NumberTheory paper to the #arXiv titled "infinite partial sumsets in the primes". https://arxiv.org/abs/2301.10303 The main result is that there exist two increasing sequences \(a_1 < a_2 < \dots \) and \(b_1 < b_2 < \dots\) such that \(a_i+b_j\) is prime for all \(i<j\). The argument uses the Maynard sieve and an intersectivity lemma of Bergelson. I discuss this result further on my blog at https://terrytao.wordpress.com/2023/01/26/infinite-partial-sumsets-in-the-primes/\)
Infinite partial sumsets in the primes

We show that there exist infinite sets $A = \{a_1,a_2,\dots\}$ and $B = \{b_1,b_2,\dots\}$ of natural numbers such that $a_i+b_j$ is prime whenever $1 \leq i < j$.

arXiv.org
one underrated nice part of having PMs at my jobs is I will periodically see a document summarizing my team's work to leadership and I will read it and find out that our PM actually spent a nontrivial amount of time reading and understanding the code I wrote in the last 3 months when I thought nobody was looking

the dril candles tweet guy is real. he was Zaurg on SomethingAwful. posted about his then-wife who bought a houseful of candles.

zaurg got into cryptocurrencies. he bought shitcoins at December 2017 peak on a credit card. someone on SA bought him a "SELL YOUR SHITCOINS" avatar and custom forum emoji.

"the dril candles tweet guy? yeah, he's into cryptocurrencies now."