Top all-time · #7782
Luca Lombardo
Personal blog · lukefleed.xyz/postsmathprogrammingsystems
Luca Lombardo's personal blog at lukefleed.xyz covers math, programming and systems. Since 2025, 10 different Hacker News readers have linked it 16 times, most often “Who Owns the Memory? Part 1: What Is an Object?”. It is still writing: the last post was on 2026-08-15, and you can follow it by feed.
Too few sampled comments (2) to say how often HN recommends it.?
Why HN links it
HN readers link this blog for in-depth posts on low-level Rust and numerical code, including a cache-friendly, low-memory Lanczos algorithm and a series on Rust memory ownership and LLVM output.
Summarised by Claude from a sample of 2 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.
A mathematician who turned to the dark side of computer science.
Most-linked posts?
- Who Owns the Memory? Part 1: What Is an Object?6 people · 6 mentions · first linked 2026-01-01
- Who Owns the Memory? Part 2: Who Calls Free?2 people · 2 mentions · first linked 2026-01-04
- Engineering a fixed-width bit-packed integer vector in Rust2 people · 2 mentions · first linked 2025-09-24
- Who Owns the Memory? Part 3: How Big Is Your Type?2 people · 2 mentions · first linked 2026-01-06
- How Is Compression Prediction?2 people · 2 mentions · first linked 2026-08-17
What Hacker News says?
BLAS/LAPACK don't do any block level optimizations. Heck, they don't even let you define a fixed block sparsity pattern. Do the math yourself and write down all 16 sparsity patterns for a 2x2 block matrix and try to find the inverse or LU decomposition on paper. https://lukefleed.xyz/posts/cache-friendly-low-memory-lanczo... I mean just look at the saddle point problem you mentioned in that section. It's a block mat…
Comment linking /posts/cache-friendly-low-memory-lanczos/
on “Cache-friendly, low-memory Lanczos algorithm in Rust”Submitted Cache-friendly, low-memory Lanczos algorithm in Rust as a story · 141 points
HN discussionCorrect, I was reading a very interesting blog post [1] on how the rust compiler will change the LLVM annotaions like sending noalias for mutable pointer. This changes a lot the generated machine code. Disabling the borrow checker won't enable those LLVM flags. [1] https://lukefleed.xyz/posts/who-owns-the-memory-pt1/
Comment linking /posts/who-owns-the-memory-pt1/
on “Rust–: Rust without the borrow checker”Submitted Engineering a fixed-width bit-packed integer vector in Rust as a story · 89 points
HN discussionSubmitted How Is Compression Prediction? as a story · 8 points
HN discussionSubmitted Who Owns the Memory? Part 2: Who Calls Free? as a story · 3 points
HN discussionSubmitted Engineering a fixed-width bit-packed Integer Vector in Rust as a story · 3 points
HN discussionSubmitted Who Owns the Memory? Part 1: What Is an Object? as a story · 2 points
HN discussionSubmitted How Is Compression Prediction? as a story · 1 points
HN discussionSubmitted Who owns the memory? Who calls free? as a story · 1 points
HN discussionSubmitted Who owns the memory? How big is your type? as a story · 1 points
HN discussionSubmitted Who Owns the Memory? Part 3: How Big Is Your Type? as a story · 1 points
HN discussionSubmitted Who owns the wemory? What is an Object? as a story · 1 points
HN discussionSubmitted Who Owns the Memory? Part 1: What Is an Object? as a story · 1 points
HN discussionSubmitted Who Owns the Memory? Part 1: What Is an Object? as a story · 1 points
HN discussionSubmitted Who Owns the Memory? Part 1: What Is an Object? as a story · 1 points
HN discussion