Work in progress: 181,232 of 181,233 sites checked so far, more every week · updated 2 Nov 2026Missing a blog? Tell us

Top all-time · #13983

M

Martin Loncaric

Personal blog · graphallthethings.commathprogrammingdata

Martin Loncaric writes Graph All The Things, a personal blog at graphallthethings.com about math, programming and data. Since 2021, 5 different Hacker News readers have linked it 10 times, most often “Dtype_dispatch: a macro that defines macros that define enums and match them”. No feed was found, so read it on the site itself.

No feed foundVisit the blog
10mentions?
5HN people?
2021–2025first – last linked?
Links on Hacker News per year · peak 5 in 2024

Too few sampled comments (1) to say how often HN recommends it.?

Why HN links it

Martin Loncaric's blog posts on quantile compression for numerical data, which HN readers link as a fuller explanation of the Q_compress lossless compressor than the linked project page.

Summarised by Claude from a sample of 1 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.

Map of Countries - Graph All The Things, a math blog by Martin Loncaric

Most-linked posts?

  1. Dtype_dispatch: a macro that defines macros that define enums and match them
    2 people · 2 mentions · first linked 2024-11-16
  2. The Parquet We Could Have
    2 people · 2 mentions · first linked 2024-01-07
  3. Zero-Copy Reads in Rust
    2 people · 2 mentions · first linked 2024-11-14

What Hacker News says?

  1. rurban · 2022-02-18Recommends
    The blog post about it is better: https://graphallthethings.com/posts/quantile-compression/

    Comment linking /posts/quantile-compression/

    on “Q_compress: Lossless compressor and decompressor for numerical data”
  2. Submitted Fruits (2020) as a story · 147 points

    HN discussion
  3. I made this open source compression algorithm as part of a database I'm creating. It typically compresses columns of numerical data to ~25% smaller than alternatives (think .snappy.parquet or .gzip.parquet) at similar or cheaper compute cost. It decompresses 15-100 million 64-bit numbers per second on a single i5 CPU per second. I also made a blog post that introduces the idea more from the math perspective: https:/…

    Comment linking /posts/quantile-compression

    on “New, better compression for columns of numerical data”
  4. Submitted Dtype_dispatch: a macro that defines macros that define enums and match them as a story · 17 points

    HN discussion
  5. Submitted Zero-Copy Reads in Rust as a story · 3 points

    HN discussion
  6. Submitted Dtype_dispatch: A Beautiful Hack as a story · 2 points

    HN discussion
  7. Submitted The Parquet We Could Have (Pco Parquet) as a story · 2 points

    HN discussion
  8. Submitted The Parquet We Could Have as a story · 2 points

    HN discussion
  9. Submitted Reducing Parquet 71% with Quantile Compression as a story · 2 points

    HN discussion
  10. Submitted BetterBufRead: Faster Reads in Rust as a story · 1 points

    HN discussion

Search all of HN for graphallthethings.com