Silvestro Ranucci
@sranu.bsky.social
I live at the intersection.
By day TypeScript with Effect.ts.
By night Rust.
Opinions are my own.
By day TypeScript with Effect.ts.
By night Rust.
Opinions are my own.
Reposted by Silvestro Ranucci
Belay uses this super cool algorithm called Rateless Invertable Bloom Lookup Tables ( video ) to figure out which documents each peer has and sync them only the ones that they don't have in both directions.
40x less overhead! Rateless Invertible Bloom Filters - Part 3 of 3
YouTube video by number 0
www.youtube.com
March 3, 2025 at 1:16 AM
Belay uses this super cool algorithm called Rateless Invertable Bloom Lookup Tables ( video ) to figure out which documents each peer has and sync them only the ones that they don't have in both directions.