Omg no the best feature in the next release is that videos keep playing even if they’re scrolled slightly up, instead of stopping when they get within an inch of the edge
This is super cool, very nice [@sri.xyz](
Bluesky Social
Sri (@sri.xyz)
Too many things. Too little time. learning & atprotoing @ Taproot (@atproto.at), ATPI (@atpi.at), stuff…
 ) [sri.xyz/projects/atp...](
Launching Taproot (atproto.at://) - All-in-one AT Protocol Explorer
Prefix atproto. to any AT URI to instantly preview.
 ) [Launching atproto.at:// - All-...](
Launching Taproot (atproto.at://) - All-in-one AT Protocol Explorer
Prefix atproto. to any AT URI to instantly preview.
 )
The trick is to quickly understand the core jargon of a subject matter and use it correctly in a sentence
#programming This may end up being a dead end, but I've gotten some promising initial results on community detection using low-iteration Louvain against the follow graph weighted by interactions.
Time to do some release engineering. We broke from our regular rhythm on this one to make it a slightly bigger update. It's going to be worth the wait though! It's got something for everyone.
Ed1 encryption was just putting "please don't read this" in the handshake so it's come a long way RE:
Bluesky Social
Paul Frazee (@pfrazee.com)
They had to get through Eds 1 through 25518 [contains quote post or other embedded content]
 View quoted note β†’
They had to get through Eds 1 through 25518 RE:
Bluesky Social
Brooklyn Zelenka (@expede.wtf)
It didn't work for me even a few weeks ago on a fresh Chrome download β€” tried now and it works πŸŽ‰ Finally: Ed25519 support in all major browser...
If you're not a programmer, this is some fun trivia If you are a programmer, feel free to correct anything I got wrong. I didn't get a CS degree so sometimes I botch big-O RE:
Bluesky Social
Paul Frazee (@pfrazee.com)
The O(n) notation is a way that programmers measure how much work something takes. You can generally think of it as "how many times do you have to ...
After about 4 days of running non-stop, I've decided that O(nΒ³) time complexity Node Similarity calculation is probably a fool's errand. In hindsight I think 1.25Γ—10²⁰ is too many computations.
I just crouched ten times in a row and feel like I worked out. The squat machine is a lie by big squat.