//
sign in
Profile
by @danabra.mov
Profile
by @dansshadow.bsky.social
Profile
by @jimpick.com
AviHandle
by @danabra.mov
AviHandle
by @dansshadow.bsky.social
AviHandle
by @katherine.computer
EventsList
by @katherine.computer
ProfileHeader
by @dansshadow.bsky.social
ProfileHeader
by @danabra.mov
ProfileMedia
by @danabra.mov
ProfilePlays
by @danabra.mov
ProfilePosts
by @danabra.mov
ProfilePosts
by @dansshadow.bsky.social
ProfileReplies
by @danabra.mov
Record
by @atsui.org
Skircle
by @danabra.mov
StreamPlacePlaylist
by @katherine.computer
+ new component
ProfilePosts









Loading...
This HyperLogLog article is a monster, but definitely forcing me to learn a lot more about bit manipulation and probabilistic structures. Rewriting the intro section to lead with strings instead of straight bits to soften the ramp more.
Who am I going to see at RubyConf this year?
Who am I going to be seeing at RubyConf this year?
One of these days I need to learn Rust.
Who am I going to be seeing at RubyConf this year?
(* if it is not abundantly clear I am in fact autistic, and I have been well known to go to extremes when exploring something of interest)
What if, by trading 1% correctness, you could count billions of items all within kilobytes worth of space? Well that's HyperLogLog, and as a non-bit-enlightened Rubyist it was a trip figuring out how it worked and how to explain it. baweaver.com/writing/2026...
What if, by trading 1% correctness, you could count billions of items all within kilobytes worth of space? Well that's HyperLogLog, and as a non-bit-enlightened Rubyist it was a trip figuring out how it worked and how to explain it. baweaver.com/writing/2026...
The problem with optimizing indexes is if you don't control every query, and another team goes and writes an unoptimal variant in their code. You, of course, will not discover this until weeks later in an outage. baweaver.com/writing/2026...