djacobs7

I built this website because I love meeting new people, because I work from home, and I was tired of sitting on big Zoom calls where I couldn't get to know anybody. Here, events are audio only, so they don't feel like a zoom meeting. You get to have one on one time with a bunch of people, so it doesn't feel like you are just sitting and watching someone talk. You will be connected with a random person in the group; when your conversation is done, just hit next to move on to your next new contact.

Is the article saying that the M1 is slower than we would have expected in this case?

My understanding, based on the article, is that a normal processor, we would have expected arr[idx] + arr[idx+1] and arr[idx] to take the same amount of time.

But the M1 is so parallelized that it goes to grab both arr[idx] and arr[idx+1] separately. So we have to wait for both of those two return. Meanwhile, on a less parallelized processor, we would have done arr[idx] first and waited for it to return, and the processor would realize that it already had arr[idx+1] without having to do the second fetch.

Am I understanding this right?

This is a little R package I wrote for doing spaced repetition in R: https://www.dontyouremember.com/

It's crazy how similar pop music sounds from all over the world. The language differs, but the energy of the music is similar in a lot of different countries.

I wonder if this is because everyone is using digital audio workstations like Ableton or Logic now. It used to be that different places had different instruments; and it would take years to become an expert. But now, the DAW is everybody's instrument.

Neat product. Looks like it needs a little polishing on the UI, otherwise looking forward to seeing what's coming next!

Is it really true that you should compress before you encrypt? IT seems to me that the encrypted message should have the same amount of "information entropy" as the original message, so it should compress equally well.