Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
Sesse__
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
4 ms
·
1.
▲
by
Sesse__
5d ago
You're probably thinking of https://github.com/simonlindholm/decomp-permuter , which is used across many more decomp projects (and can do a lot more than swap lines). It's a huge help, but it's by no mean
2.
▲
by
Sesse__
5d ago
https://decomp.dev/ is probably (roughly) what you're looking for.
3.
▲
by
Sesse__
5d ago
> It’s AOT dynamic recompilation and the original IP isn’t distributed. The Git repository contains tens of thousands of lines of assembler code that seem to come from the original.
4.
▲
by
Sesse__
8d ago
They are designed by different teams and have different ways of doing math. You could just as easily say “why are the efficiency cores wasting an extra cycle for each multiplication doing fixups of an uncommon case”. Fabian Giesen explains
5.
▲
by
Sesse__
9d ago
> For example, one could analyze _actual_ distributions or whatever (instead of assuming uniform) Postgres keeps histograms (including N most common values) for all columns; it does not blindly assume uniform distributions. (Presumably a
6.
▲
by
Sesse__
9d ago
I think calling GEQO generative is a bit of a stretch; it's just a different way of searching through the same space with the same cost model. More or less devolving to “let's take a bunch of randomized join orders and see which o
7.
▲
by
Sesse__
9d ago
GEQO is not to get a better plan than the traditional optimizer, it is to be able to get a plan at all when the query is large. And it's widely known for creating poor plans.
8.
▲
by
Sesse__
9d ago
There are papers and Postgres projects that attempt this kind of learning-based optimization, with some success. None are in widespread use. (One part, but certainly not the entirety, of the problem is that it's not just A/B, it&#
9.
▲
by
Sesse__
9d ago
If you have formulas that actually match reality, what do you need the LLM for? An optimizer is perfectly capable of finding the optimal plan if it has a perfect estimator. In fact, if you could only estimate the number of rows in each subp
10.
▲
by
Sesse__
10d ago
This immediately halves your throughput.
11.
▲
by
Sesse__
10d ago
The immediate problem: How do you know which one is better without running them?
12.
▲
by
Sesse__
24d ago
“Phoronix, but high quality” would also be great. People kept asking if they could pay for AnandTech, and they said “we'll think about it” for years until they shut down instead because it was financially unsustainable.
13.
▲
by
Sesse__
25d ago
Still, we're talking orders of magnitude here. I've fed Shazam with a stream of the cheapest lapel microphone you could get, mounted behind a rack filled with twelve very noisy servers, in a hall filled with 5000 people also all b
14.
▲
by
Sesse__
25d ago
For me, mostly a lot of false negatives. I have a Pixel 8, and I have no problems using the microphone normally, but somehow, Merlin requires the bird to be within a couple of meters of me and sing for quite a while before Merlin will even
15.
▲
by
Sesse__
28d ago
For any complex system, there's never one single trick or design choice that makes it fast. It's always a large amount of engineering (or exaggerations, of course).
16.
▲
by
Sesse__
29d ago
> Yeah, it's not nearly as cool to say "I prompted a probabilistic pile of tensors and it did the hard work for me", and I think it majorly adjusts how "impressive" projects are. Vibe-decomped projects are also…
17.
▲
by
Sesse__
29d ago
Yes. Especially when there are common libraries and you can reuse their names, structures or even entire decompiled routines. There's a fair amount of folklore going around, but less direct sharing than would be ideal.
18.
▲
by
Sesse__
1mo ago
> Historically there was a notion of "clean room" reimplementation These projects start off with the original assembly code and use it actively throughout all stages. This is about as far away from clean room as you get.
19.
▲
by
Sesse__
1mo ago
> I think he's saying that building a browser is not a transferrable skill, like making a generic web page is. Employers don't like specialists. I recently switched roles, and among the seven places I interviewed, none of them
20.
▲
by
Sesse__
1mo ago
> I wonder if any equipment ever actually used those other flags for anything? MiniDisc did. You could make one (digital) copy but not two.
21.
▲
by
Sesse__
1mo ago
MP3 decoders have, thankfully, gotten faster since the 90s. But yes, a 66MHz is pushing it indeed.
22.
▲
by
Sesse__
1mo ago
Yes. Which matters a lot when you cannot just update OS kernels willy-nilly (most people did not have Internet connectivity, Windows Update did not exist before Windows 98).
23.
▲
by
Sesse__
2mo ago
Generally most forms of PGO does not try to capture number of mispredicted branches (which isn't the same as how often a branch is taken).
24.
▲
by
Sesse__
2mo ago
I once got that question, started with the keyboard switches and the interrupts, and the interviewer sighed and asked me to get to the stuff in the browser.
25.
▲
by
Sesse__
2mo ago
The demoscene still exists, although it doesn't seem to attain a lot of new members, and most (not all!) of the activity is back on oldschool platforms like Amiga or similar. See e.g. https://www.pouet.net/ ; Assembly 2
26.
▲
by
Sesse__
2mo ago
No, not really. Highway generates rather bad code as soon as you step outside a pretty narrow vertically-oriented scope, in my experience.
27.
▲
by
Sesse__
2mo ago
GF2P8AFFINE has entered the chat. (I've both played bridge actively and written SIMD code professionally, bridge rules are way simpler. Actually playing good bridge is probably harder.)
28.
▲
by
Sesse__
2mo ago
You may be interested in OpenMP.
29.
▲
by
Sesse__
2mo ago
Interesting, but if you are not robust to corrupted/malicious data, it is really in a different class of algorithm and it is hard to compare speeds directly. From memory, 2505 MB/sec also sounds on the low side for LZ4 on a moder
30.
▲
by
Sesse__
3mo ago
Android uses one uid per app.
More ›