Hi, nice to meet you, my name is Orson Raphael Lennard Peters. I am a programmer, computer scientist, recreational mathematician, amateur musician and general all-around nerd. I was born in 1994 in Houston, Texas, but both my parents are Dutch and I’ve essentially lived my entire life in the Netherlands as well.
Visit orlp.net → RSS feedOn Hacker News Mar 2023 – Oct 2026
This post is an anecdote from over a decade ago, of which I lost the actual code. So please forgive me if I do not accurately remember all the details. Some details are also simplified so that anyone that likes computer security can enjoy this article, not just those who have played World of Warcraft (although the…
To be precise, IEEE-754 floating point subtraction is functionally complete . That means you can construct any binary circuit using nothing but floating point subtraction.
This December I once again did the Advent of Code , in Rust. If you are interested, my solutions are on Github. I wanted to highlight one particular solution to the day 2 problem as it is both optimized completely beyond the point of reason yet contains a useful technique. For simplicity we’re only going to do part 1…
The following Python function computes the Fibonacci sequence , without loops, recursion or floating point arithmetic:
An aggregation is some kind of summary of a set of data. This can be the sum, length, minimum, etc. It is quite common to want to calculate such a summary repeatedly, e.g. “the maximum noise level in dB for the past 30 seconds” for a nuisance detector. In such a case we say there is a sliding window over our data, and…
Suppose you have an array of floating-point numbers, and wish to sum them. You might naively think you can simply add them, e.g. in Rust:
I recently read the article Beautiful Branchless Binary Search by Malte Skarupke. In it they discuss the merits of the following snippet of C++ code implementing a binary search :