Top all-time · #5330
Jaz's Blog
Personal blog · jazco.devprogrammingsystems
Jaz's Blog is a personal blog at jazco.dev about programming and systems. Since 2023, 14 different Hacker News readers have linked it 15 times, most often “An Entire Social Network in 1.6GB (GraphD Part 2)”. It is still writing: the last post was on 2025-09-26, and you can follow it by feed.
A space where I rant about computers
Most-linked posts?
- An Entire Social Network in 1.6GB (GraphD Part 2)5 people · 5 mentions · first linked 2024-04-20
- How HLS Works4 people · 4 mentions · first linked 2024-07-05
What Hacker News says?
> then change it to vile stuff There is a hash that is stored with the record, and a real permalink is called a "strongRef". Dan did not mention this in his permalink section, hopefully he reads this and adds some more words to his post. You normally store a strongRef and can then detect when a record content no longer matches what you expect. Bluesky does not support edits specifically for the reason you mention, a…
Comment linking /2024/04/20/roaring-bitmaps/
on “Where it's at://”Submitted When imperfect systems are good: Bluesky's lossy timelines as a story · 785 points
HN discussionInteresting in hearing some thoughts about using roaring bitmaps stored in a bytea postgres column to represent adjacency matrixes. I was thinking that given RDS has support for plrust and PostgreSQL's SPI I could use the fact they support croaring-rs there as a crate and build upon that. I figure I can use that to represent many graph's with say 100s to ~100m nodes and many relations between these things. But each…
Comment linking /2024/04/20/roaring-bitmaps/
on “Postgres as a Graph Database: (Ab)Using PgRouting”Submitted Jetstream: Shrinking the AT Protocol Firehose by >99% as a story · 163 points
HN discussionSubmitted How much memory does a graph take? as a story · 104 points
HN discussionSubmitted Turning Billions of Strings into Integers Every Second Without Collisions as a story · 34 points
HN discussionSubmitted Scaling Golang to 192 Cores with Heavy I/O as a story · 22 points
HN discussionSubmitted How HLS Works as a story · 6 points
HN discussionSubmitted How HLS Works as a story · 5 points
HN discussionSubmitted An Entire Social Network in 1.6GB (GraphD Part 2) as a story · 2 points
HN discussionSubmitted How HLS Works (2024) as a story · 1 points
HN discussionSubmitted An Entire Social Network in 1.6GB as a story · 1 points
HN discussionSubmitted How HLS Works as a story · 1 points
HN discussionSubmitted An Entire Social Network in 1.6GB (GraphD Part 2) as a story · 1 points
HN discussionSubmitted Solving Thundering Herds with Request Coalescing in Go as a story · 1 points
HN discussion