Sesse__

14 ms·

241.
by Sesse__ 1y ago
It's not, though. The use of RT in games is generally limited to secondary rays; the primaries are still rasterized. (Though the rasterization is increasingly done in “software rendering”, aka compute shaders.)
242.
by Sesse__ 1y ago
> Nobodys fault really, but bad results ensued. Uh, the fault is entirely in writing an assembler _that is not an assembler_, but rather something that is _almost_ like one but then 1% like an IR instead. It's an unforced error.
243.
by Sesse__ 1y ago
The stack in that specific function was big enough to trigger the bug.
244.
by Sesse__ 1y ago
Hello ad hominem. (I am not angry. You seem to be very much into telling people “Get well soon”, though.)
245.
by Sesse__ 1y ago
How is a forced Microsoft business cloud account better than a forced Microsoft personal cloud account, really? (Just for the reference, joining the computer to a non-cloud AD does _not_ remove the requirement for a Microsoft account during
246.
by Sesse__ 1y ago
I don't know either; I was talking about the lack of PMOVMSKB in NEON and then the comment I replied to started talking about (1 << k) - 1 not being a single instruction sucks. Which I don't think it is in any non-NEON set e
247.
by Sesse__ 1y ago
Does _any_ SIMD instruction set have (1 << k) - 1 as a single instruction?
248.
by Sesse__ 1y ago
I never understood why they couldn't just include a movmskb instruction to begin with. It's massively useful for integer tasks, not expensive to implement as far as I know, and the vshrn+mov trick often requires an extra instructi
249.
by Sesse__ 1y ago
Compiler Explorer link or it didn't happen? :-)
250.
by Sesse__ 1y ago
The new one is randomly chosen (with the randomness coming from both parties, and then combined using ECDH and/or KEM). So you cannot predict it from previous key material, pretty much by definition.
251.
by Sesse__ 1y ago
Seems to work fine for me: https://gcc.godbolt.org/z/hPexshjoa
252.
by Sesse__ 1y ago
Is this specific to AVX512? It works well for e.g. AVX2.
253.
by Sesse__ 1y ago
Most likely one of: 1. Noise in the detection (the room is bright etc.) 2. The laser being a form that's not susceptible to direct modulation (if it takes a millisecond to start/stop lasing, obviously you cannot turn it on&#
254.
by Sesse__ 1y ago
> The conversion from 16 bits to 7 bits was using rounding. As a very quick fix, you can dither by just adding a random value from [-0.5, +0.5] before rounding (to -64..+63 or whatever your range is). It will give you a dither, and proba
255.
by Sesse__ 1y ago
I never really got the part about the audio conversion; are you just rounding it from 16 to 7 bits, or are you doing dithering + noise shaping (as you definitely should at such low bit depths)? And similarly, how are you downsampling from 4
256.
by Sesse__ 1y ago
> I wonder if there's a trade-off where an optimizer produces better average query plans but worse outliers. There is. A (now) classic case is running a nested loop with a sequential scan on the inner side. Works great if the outer
257.
by Sesse__ 1y ago
> I'm not super familiar with the term index merge - this seems to be the term for a BitmapOr/BitmapAnd? Different databases will use similar terms for different operations, but I would guess that the comment refers to somethin
258.
by Sesse__ 1y ago
> The query optimizer knows how many items are in each index, but has no advance idea how many items will be in the result of a JOIN. Query optimizers definitely try to estimate cardinalities of joins. It's a really, really hard pro
259.
by Sesse__ 1y ago
In most cases, the end result is a lot messier than it looks in this minimal example. Consider a case where the query is a 12-way join with a large IN list somewhere (which is essentially an OR); would it still look as attractive to duplica
260.
by Sesse__ 1y ago
It's _not_ just a list in sorted order; if it were, you could not insert efficiently into it. But the tuple is the right mental model, indeed.
261.
by Sesse__ 1y ago
Indexes in general are not flattened trees; they are just trees. Using a Python map as a mental model is fraught with peril since those are implemented as hash tables, which don't have ordering (which most database indexes need to supp
262.
by Sesse__ 1y ago
Seemingly, their way of thinking goes roughly like this: If I have 10 billion rows in an SQL database, with a UNIQUE index, and do SELECT * FROM t1 WHERE pk=<number>, then I have “processed” 10 billion rows. If I do 10k of these queri
263.
by Sesse__ 1y ago
> That is mostly an issue with the official docker image, not a PostgreSQL issue. I wish Docker would stop calling their unofficial Postgres images “official”. :-/ (They're “official Docker”, but not “official Postgres”. The na
264.
by Sesse__ 1y ago
Indeed. The output of the beamforming algorithm is something like four (complex) numbers that you use to tell which of your radios to shout the loudest (and with what delay), which magically makes the signal become the strongest possible at
265.
by Sesse__ 1y ago
> If BitTorrent knew network topology, it could act smarter -- CDNs accept BGP feeds from carriers and ISPs so that they can steer the traffic, this isn't practical for BitTorrent! AFAIK this has been suggested a number of times, bu
266.
by Sesse__ 1y ago
Are you serious? Most Debian ISO mirrors I've used have 10gig connectivity and usually push a gigabit or two fairly easily. BitTorrent is generally a lot slower than that (it's a pretty terrible protocol for connecting you to actu
267.
by Sesse__ 1y ago
How would it differ from other long ultras?
268.
by Sesse__ 1y ago
A basic block simulator like llvm-mca is unlikely to give useful information here, as memory access is going to play a significant part in the overall performance.
269.
by Sesse__ 1y ago
I didn't say it was slower, just that it was more obfuscated.
270.
by Sesse__ 1y ago
The essence of COBOL, right there.

More ›