Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
orlp
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
1.
▲
by
orlp
4d ago
1. It adds extra latency due to an extra hop. 2. It is non-bypassable tracking of every single click. 3. It does not allow you to inspect the URL to see where it goes to before visiting. 4. It breaks the feedback signal of extensions which
2.
▲
by
orlp
5d ago
We had a similar experience in Polars trying to use io_uring. Rust isn't inherently bad at io_uring but at least Tokio currently is. I'm not the one who implemented and benchmarked it so this is second-hand information but if I re
3.
▲
by
orlp
7d ago
That's a nice story and all but it isn't a reality for most people. For most people on this planet it's work or starve on the street.
4.
▲
by
orlp
7d ago
It is applicable to fast universal hashes like Poly1305 and Polymur (the latter of which I'm the author). However it's not clear to me whether this work improves over the state of the art for that purpose, see some questions here:
5.
▲
by
orlp
7d ago
> If I look at actual incidence involving memory safety issues compared to supply chain issues in general, it is the later which is much a higher risk to me. Again, can you even just name a single supply chain attack that was *shipped* i
6.
▲
by
orlp
9d ago
The above is a general rule protecting you against supply chain attacks by default. If there is an important CVE published with a patch you can manually review that patch and bypass the minimum-age requirement for that dependency specifical
7.
▲
by
orlp
9d ago
Supply chain risks are essentially a solved problem. 1. Set a minimum age on dependencies: https://github.com/rust-lang/cargo/issues/15973 2. Scan all dependency code with AI Even if you don't
8.
▲
by
orlp
12d ago
Also Wiki4D, a D programming language dev wiki: https://prowiki.org/wiki4d/wiki.cgi?action=browse&id=RecentC... Found by searching for wiki + texas poverty.
9.
▲
by
orlp
12d ago
If all you have a coin there is a simple algorithm that's equivalent to sorting by random real numbers in [0, 1]. 1. All players flips a coin. 2. Players that got heads go before players that got tails, forming (up to) two gr
10.
▲
by
orlp
13d ago
Well... once my recent work on out-of-core lands the batch could be on disk when we run out of memory budget ;) But no, that's not what I meant. I meant that the batch is meant to be of a size that fits in your CPU cache. This can be
11.
▲
by
orlp
13d ago
Streaming here has a different meaning than perhaps what you're used to. It's not referring to online processing where you maintain aggregates/state while an endless stream of data comes in. The name was chosen early on to co
12.
▲
by
orlp
13d ago
from polars import col as C df.select(C.x, y = C.w / C.z)
13.
▲
by
orlp
16d ago
If there was a continuous 500 watt GPU per person we'd increase energy consumption by more than double. The continuous energy footprint per person globally averages to 356 watt currently.
14.
▲
by
orlp
1mo ago
This is the opposite, it is further opting out of flexibility.
15.
▲
by
orlp
1mo ago
Isn't kind of the point of TLS that your communication doesn't get 'inspected'?
16.
▲
by
orlp
2mo ago
I think if you interpret it charitably it means that any bug in the emitted machine code is already a likely memory-unsafe miscompilation if it is ran. The compiler itself might be perfectly "memory safe" but the generated binary
17.
▲
by
orlp
2mo ago
That's a GCC skill issue. You can do it in five branchless instructions for unsigned by splitting the unsigned up in two 32-bit halves, converting those to floats simply by inserting their values as mantissa into constants 2^52 and 2^(
18.
▲
by
orlp
2mo ago
Don't give these ghouls ideas.
19.
▲
by
orlp
2mo ago
First, this article is mostly (AI?) regurgitation. This is much better: https://smalldatum.blogspot.com/2026/01/common-prefix-skippi... . Second, I have independently invented this (quicksort on string prefixes) at
20.
▲
by
orlp
3mo ago
This is a dumb take. It's like not teaching kids 1 + 1 because a calculator can do it for them.
21.
▲
by
orlp
3mo ago
If your data is sufficiently noisy or your relationship sufficiently simple a linear regression will outperform a SOTA LLM.
22.
▲
by
orlp
3mo ago
It seems like there aren't extra duties (anymore), but then again it's all very confusing and hard to navigate so who knows.
23.
▲
by
orlp
3mo ago
You save a lot less after paying import duties.
24.
▲
by
orlp
3mo ago
Actually, they're making an effort to force your business to not do something.
25.
▲
by
orlp
3mo ago
> Is there really anything about them that's bad? Or any worse than other things? A full-on nuclear war will literally make a large portion of our planet uninhabitable for anyone for centuries, and leave the rest severely crippled
26.
▲
by
orlp
3mo ago
https://en.wikipedia.org/wiki/Conscription_in_Iran FWIW I don't agree with the comment chain's source, I read "regular people" as "civilians" and don't think there was any nasty conno
27.
▲
by
orlp
3mo ago
Copyright being as long as it is is a theft of our culture. I (and many of our generation) grew up with Pokemon, it's a common experience for many of us. A classic of our culture. Except we're not allowed to use it, remix it, buil
28.
▲
by
orlp
3mo ago
It's just a play on words, something lightweight drifts in the wind rather than gliding on a wing. It's really not all that deep.
29.
▲
by
orlp
3mo ago
It's called driftsort because it's derived from another sort I made, glidesort: https://github.com/orlp/glidesort . Glidesort is a bit faster still for large inputs, however it was too large and complex for in
30.
▲
by
orlp
3mo ago
Since pdqsort (an older project of mine) was mentioned, I felt it wouldn't be entirely inappropriate to mention that I've since then collaborated with Lukas Bergdoll to provide two high-quality sort implementations for the Rust st
More ›