Top all-time · #2690
Orson Peters
Personal blog · orlp.net · on HN as orlpprogrammingmath
Orson Peters's personal blog at orlp.net covers programming and math. Since 2023, 21 different Hacker News readers have linked it 39 times, most often “Ordering Numbers, How Hard Can It Be?”. It is still writing: the last post was on 2026-10-14, and you can follow it by feed.
Most-linked posts?
- Ordering Numbers, How Hard Can It Be?3 people · 4 mentions · first linked 2023-01-27
- Subtraction Is Functionally Complete3 people · 4 mentions · first linked 2023-09-28
- Magical Fibonacci Formulae3 people · 3 mentions · first linked 2023-02-07
- The Smallest Hash Table3 people · 3 mentions · first linked 2023-03-04
- Bitwise Binary Search: Elegant and Fast3 people · 3 mentions · first linked 2023-05-16
- When Random Isn't2 people · 3 mentions · first linked 2024-01-10
- Extracting and Depositing Bits2 people · 2 mentions · first linked 2024-01-14
- Two-Stack Sliding-Window Aggregation2 people · 2 mentions · first linked 2026-10-04
- Sorting with Fibonacci numbers, and a Knuth reward check2 people · 2 mentions · first linked 2026-01-01
- Why Bad AI Is Here to Stay2 people · 2 mentions · first linked 2025-02-06
What Hacker News says?
This fits one of the patterns I wrote about ~1.5 years ago: https://orlp.net/blog/bad-ai/#objective-p-mathrm-relevant-1-... I think it still holds up.
Comment linking /blog/bad-ai/
on “Opus 5.5 agents discover two room-temperature magnetic semiconductor candidates”Submitted When Random Isn't as a story · 376 points
HN discussionI'm very confused by the article. It's missing about two decades of modern non-cryptographic general hash development, it completely fails to mention the field of universal hashing which created formal criteria for collision probability and produced provably correct constructs to achieve those criteria... As a self-plug for a related topic, I think going forward we should also take into account HashDoS for non-crypt…
Comment linking /blog/breaking-hash-functions/
on “Questioning the Criteria for Evaluating Non-Cryptographic Hash Functions”Submitted Two-Stack Sliding-Window Aggregation as a story · 142 points
HN discussionSee also https://orlp.net/blog/taming-float-sums/
Comment linking /blog/taming-float-sums/
on “Faster floating point math with Rust's new API”Submitted Taming floating-point sums as a story · 120 points
HN discussionhttps://orlp.net/ I post occasionally, usually with mathy or low-level optimization content.
Comment linking /
on “Ask HN: Could you share your personal blog here?”Submitted Breaking CityHash64, MurmurHash2/3, wyhash, and more as a story · 50 points
HN discussionI remember having to prove Binet's formula[1] for a math class and then going back to my CS classes and asking why they never showed us that it existed. I'm not sure they knew it existed either [1]( https://orlp.net/blog/magical-fibonacci-formulae/#an-interlu... )
Comment linking /blog/magical-fibonacci-formulae/
on “Magical Fibonacci Formulae”Submitted Subtraction Is Functionally Complete as a story · 10 points
HN discussionSubmitted Why Bad AI Is Here to Stay as a story · 8 points
HN discussionSubmitted Black-box HashDoS: attacking hash tables without knowing the hash function as a story · 4 points
HN discussionSubmitted Two-stack sliding-window aggregation as a story · 4 points
HN discussionSubmitted When Random Isn't as a story · 4 points
HN discussionSubmitted Ordering Numbers, How Hard Can It Be? as a story · 4 points
HN discussionSubmitted Extracting and Depositing Bits as a story · 3 points
HN discussionSubmitted When Random Isn't as a story · 3 points
HN discussionSubmitted Branchless Lomuto Partitioning as a story · 3 points
HN discussionSubmitted Subtraction Is Functionally Complete as a story · 3 points
HN discussionSubmitted The Smallest Hash Table as a story · 3 points
HN discussionSubmitted Black-Box HashDoS: Attacking Hash Tables Without Knowing the Hash Function as a story · 2 points
HN discussionSubmitted Sorting with Fibonacci numbers, and a Knuth reward check as a story · 2 points
HN discussionSubmitted (Floating Point) Subtraction Is Functionally Complete as a story · 2 points
HN discussionSubmitted Bitwise Binary Search: Elegant and Fast as a story · 2 points
HN discussionSubmitted The Smallest Hash Table as a story · 2 points
HN discussionSubmitted Sorting with Fibonacci Numbers and a Knuth Reward Check as a story · 1 points
HN discussionSubmitted Why Bad AI Is Here to Stay as a story · 1 points
HN discussionSubmitted Extracting and Depositing Bits as a story · 1 points
HN discussionSubmitted Magical Fibonacci Formulae as a story · 1 points
HN discussionSubmitted Branchless Lomuto Partitioning as a story · 1 points
HN discussion
