jleahy

22 ms·

211.
by jleahy 6y ago
A 1-bit error in a compressed file will cause every subsequent bit in the entire file to end up wrong (well, 50% of them), and probably the file length to end up wrong, and probably the decompression state machine to get stuck and confused.
212.
by jleahy 6y ago
There's a very good chance that a single bad bit in a 10 GB Windows game will prevent it from loading. The average game might contain a multi-megabyte executable along with gigabytes of assets. Those assets will be stored in some kind
213.
by jleahy 6y ago
It’s neither, and that’s precisely the point.
214.
by jleahy 6y ago
Big enough to measure hardness, and we've been able to make it ourselves since the 60s, but in measurements it's always less hard than diamond. Only in computer simulation is it actually harder. I guess they glossed over that bit
215.
by jleahy 6y ago
Or NTSC and PAL. I wonder if my 3440x1440 screen is NTSC or PAL?
216.
by jleahy 6y ago
Does it have to be better, or even preferable? Is "it's sufficiently good for my needs but it's free" not enough? Whole industries have died because a free product has emerged that's "good enough" for 90+%
217.
by jleahy 6y ago
All great, then you need to port it to something other than that one specific SSD and it's too much work. We have abstraction boundaries for a reason, we give up a small % of performance and in return we can write code once (say SQLite
218.
by jleahy 6y ago
It'll be there forever (compatibility), but the problem is there's not a lot of overlap between 1.x and 3.x/4.x. I think people are better sticking to the 3.x core profile. Shaders just aren't that hard and fixed functio
219.
by jleahy 6y ago
And just for you, I pulled some very ancient code of mine (2012) and stripped it down enough so that it renders a single triangle (and you can move around), nothing more. https://github.com/jleahy/gldemo That's a
220.
by jleahy 6y ago
Like it or not, the answer is probably OpenGL. If you go with version 3.3 (a good choice in my opinion) and then it's really only a few function calls and you're submitting vertices, and it's going to be supported on any plat
221.
by jleahy 6y ago
There's nothing specialist there, you can get a small kit for a few dollars that has a set of small screwdriver heads and a spludger. That's all you need. Give it a go, what's the worst that can happen (ok the worst is that y
222.
by jleahy 6y ago
Even if you pretend it’s a few values (which it’s not, there are a lot of floats), this would be dramatically slower due to the cache miss involved.
223.
by jleahy 6y ago
Not long ago there was an FPGA inside the iPhone (an ice40). Hardly niche.
224.
by jleahy 6y ago
Yes, the vaccine you'll feel a bit rough for a few days after (potentially). The saline you won't.
225.
by jleahy 6y ago
Title from a parallel universe where it wasn't sponsored: "You don't need a blockchain, you just need to pick one of Postgres, MySQL or SQLite"
226.
by jleahy 6y ago
I routinely use modern X applications running on a remote (25 miles) machine, all day long as part of my job. It works flawlessly if you have a reasonable amount of bandwidth and reasonable latency. Sure, it doesn’t work over dial-up.
227.
by jleahy 6y ago
I presumed he misspoke and meant vaccinations.
228.
by jleahy 6y ago
Not quite. JS is round towards zero, ie. the same as C. If you look at the x86 instruction set then until SSE2 (when Intel specifically added an extra instruction to achieve this) this was extremely awkward to achieve. x86 always did round-
229.
by jleahy 6y ago
In at least some locales tolower segfaults under that condition, in glibc at least. (before anyone says that ‘in reality it’s probably fine’)
230.
by jleahy 6y ago
You split your data into chunks, say 8-bits. The main thing is that you can guarantee there will be a transition every N bits and you can guarantee that the average number of ones and zeros is the same (you can't have a DC component in
231.
by jleahy 6y ago
Actually not too much work. Some protocols (I can’t recall which, none of the above) work by sending either the data or its inverse along with an extra bit saying whether it was inverted. Very easy in hardware but has nasty error amplificat
232.
by jleahy 6y ago
Correct, and these attacks exist and will cause a link to go down. It’s a problem that was considered in the design of both 10G ethernet and PCIe which both use similar mechanisms. Generally a key defence is the maximum packet size (you can
233.
by jleahy 6y ago
Hi Ido :-) They still do that, I can confirm.
234.
by jleahy 6y ago
The UK is pragmatic, if you have more than two children (and all except the youngest two are over 3) then you only need to put the youngest two in car seats. They know you can’t easily fit a third one. Seems very reasonable.
235.
by jleahy 6y ago
That's actually the wrong way round. For advanced designs the instruction set really doesn't matter that much, the bulk of the silicon in a modern advanced CPU is spent doing things like caching, branch prediction, instruction sch
236.
by jleahy 6y ago
I’m a vim+gcc user and have never used an IDE in my life, yet even I can’t live without STM32CubeMX. You’d have to be crazy to live without it, how could you possibly figure out non-overlapping pin assignments.
237.
by jleahy 6y ago
Unfortunately in many cases this will cause all of the parameters to be passed via the stack rather than in registers. It’s a meaningful penalty for the kind of people who would willingly select c++ as a language today (rather than, say, py
238.
by jleahy 6y ago
The fundamental mitigation is full memory encryption using a randomly generated key that changes each time the CPU boots. That exists for some CPUs.
239.
by jleahy 6y ago
The main linux page cache is 50% LRU and 50% LFU (half of the available memory devoted to each).
240.
by jleahy 6y ago
There are many ways, and they look nothing like this of course. For a hint, have a look at how a CPU implements the LRU cache (eg. L1, L2). It’s not rocket science.

More ›